Base | Representation |
---|---|
bin | 1001100100010110000100… |
… | …11000100011100111000101 |
3 | 2202111101221112201000002222 |
4 | 10302023002120203213011 |
5 | 10224204420311024104 |
6 | 112425351515542125 |
7 | 4301043041652662 |
oct | 462130230434705 |
9 | 82441845630088 |
10 | 21040011033029 |
11 | 678202279727a |
12 | 243984115a945 |
13 | b980ab9c5941 |
14 | 52a4b0504a69 |
15 | 2674740631be |
hex | 1322c26239c5 |
21040011033029 has 2 divisors, whose sum is σ = 21040011033030. Its totient is φ = 21040011033028.
The previous prime is 21040011032959. The next prime is 21040011033047. The reversal of 21040011033029 is 92033011004012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19943351776804 + 1096659256225 = 4465798^2 + 1047215^2 .
It is a cyclic number.
It is not a de Polignac number, because 21040011033029 - 220 = 21040009984453 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21040011032989 and 21040011033007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21040011033329) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10520005516514 + 10520005516515.
It is an arithmetic number, because the mean of its divisors is an integer number (10520005516515).
Almost surely, 221040011033029 is an apocalyptic number.
It is an amenable number.
21040011033029 is a deficient number, since it is larger than the sum of its proper divisors (1).
21040011033029 is an equidigital number, since it uses as much as digits as its factorization.
21040011033029 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 26.
The spelling of 21040011033029 in words is "twenty-one trillion, forty billion, eleven million, thirty-three thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •