World Library  
Flag as Inappropriate
Email this Article

353 (number)

Article Id: WHEBN0006356194
Reproduction Date:

Title: 353 (number)  
Author: World Heritage Encyclopedia
Language: English
Subject: Megaprime, Twin prime, 495 (number), Mersenne prime, 420 (number)
Collection:
Publisher: World Heritage Encyclopedia
Publication
Date:
 

353 (number)

352 353 354
Cardinal three hundred fifty-three
Ordinal 353rd
(three hundred and fifty-third)
Factorization 353
Prime yes
Roman numeral CCCLIII
Binary 1011000012
Ternary 1110023
Quaternary 112014
Quinary 24035
Senary 13456
Octal 5418
Duodecimal 25512
Hexadecimal 16116
Vigesimal HD20
Base 36 9T36

353 is the natural number between 352 and 354. It is a prime number.

In mathematics

In connection with Euler's sum of powers conjecture, 353 is the smallest number whose 4th power is equal to the sum of four other 4th powers, as discovered by R. Norrie in 1911:[1][2][3]

353^4=30^4+120^4+272^4+315^4.

353 is a palindromic prime,[4] an irregular prime,[5] and a super-prime.[6] 353 is one of the solutions to the stamp folding problem: there are exactly 353 ways to fold a strip of eight blank stamps into a single flat pile of stamps.[7] In a seven-team round robin tournament, there are 353 combinatorially distinct outcomes in which no subset of teams wins all its games against the teams outside the subset; mathematically, there are 353 strongly connected tournaments on seven nodes.[8]

Other uses

353 is also the country code for telephone numbers in the Republic of Ireland.

References

  1. ^ "Sloane's A003294 : Numbers n such that n^4 can be written as a sum of four positive 4th powers", The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  2. ^ .
  3. ^ .
  4. ^ "Sloane's A002385 : Palindromic primes", The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  5. ^ "Sloane's A000928 : Irregular primes", The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  6. ^ "Sloane's A006450 : Primes with prime subscripts", The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  7. ^ "Sloane's A001011 : Number of ways to fold a strip of n blank stamps", The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  8. ^ "Sloane's A051337 : Number of strongly connected tournaments on n nodes", The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
 
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
 
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.
 


Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.