Base | Representation |
---|---|
bin | 111110110011010010010000… |
… | …0111110101011110101001001 |
3 | 2200102220112101011101212200102 |
4 | 1331212210200332223311021 |
5 | 1034401111212133404001 |
6 | 5234511551312215145 |
7 | 224233020421253006 |
oct | 17546444076536511 |
9 | 2612815334355612 |
10 | 552406362013001 |
11 | 15001724a174621 |
12 | 51b58078b3a4b5 |
13 | 1a9309090561a2 |
14 | 9a5a8795dc8ad |
15 | 43ce555729e6b |
hex | 1f66920fabd49 |
552406362013001 has 8 divisors (see below), whose sum is σ = 552443481707208. Its totient is φ = 552369243600000.
The previous prime is 552406362012959. The next prime is 552406362013069. The reversal of 552406362013001 is 100310263604255.
It can be written as a sum of positive squares in 4 ways, for example, as 152616374440000 + 399789987573001 = 12353800^2 + 19994749^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 552406362013001 - 226 = 552406294904137 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (552406362010001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 955363541 + ... + 955941581.
It is an arithmetic number, because the mean of its divisors is an integer number (69055435213401).
Almost surely, 2552406362013001 is an apocalyptic number.
It is an amenable number.
552406362013001 is a deficient number, since it is larger than the sum of its proper divisors (37119694207).
552406362013001 is a wasteful number, since it uses less digits than its factorization.
552406362013001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 640603.
The product of its (nonzero) digits is 129600, while the sum is 38.
The spelling of 552406362013001 in words is "five hundred fifty-two trillion, four hundred six billion, three hundred sixty-two million, thirteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •