Base | Representation |
---|---|
bin | 1010001100000010101101… |
… | …0000000000000111010101 |
3 | 1110122220022122220022010221 |
4 | 2203000223100000013111 |
5 | 2432013144040314104 |
6 | 35454043343314341 |
7 | 2234214003456025 |
oct | 243005320000725 |
9 | 43586278808127 |
10 | 11202000323029 |
11 | 362981816843a |
12 | 130b0332ab9b1 |
13 | 633461ca1609 |
14 | 2aa273197a85 |
15 | 1465ca556c54 |
hex | a302b4001d5 |
11202000323029 has 2 divisors, whose sum is σ = 11202000323030. Its totient is φ = 11202000323028.
The previous prime is 11202000322951. The next prime is 11202000323069. The reversal of 11202000323029 is 92032300020211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11102210672004 + 99789651025 = 3331998^2 + 315895^2 .
It is a cyclic number.
It is not a de Polignac number, because 11202000323029 - 221 = 11201998225877 is a prime.
It is a super-2 number, since 2×112020003230292 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11202000322994 and 11202000323012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11202000323069) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5601000161514 + 5601000161515.
It is an arithmetic number, because the mean of its divisors is an integer number (5601000161515).
Almost surely, 211202000323029 is an apocalyptic number.
It is an amenable number.
11202000323029 is a deficient number, since it is larger than the sum of its proper divisors (1).
11202000323029 is an equidigital number, since it uses as much as digits as its factorization.
11202000323029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 25.
The spelling of 11202000323029 in words is "eleven trillion, two hundred two billion, three hundred twenty-three thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •