Base | Representation |
---|---|
bin | 1001100011100010000101… |
… | …10101000010001110010101 |
3 | 2202101201220110110010220212 |
4 | 10301301002311002032111 |
5 | 10223230240402223104 |
6 | 112404454231335205 |
7 | 4266034312252355 |
oct | 461610265021625 |
9 | 82351813403825 |
10 | 21012101211029 |
11 | 6771200392985 |
12 | 2434352221505 |
13 | b9558168cb76 |
14 | 528dc390ab65 |
15 | 26688dbb136e |
hex | 131c42d42395 |
21012101211029 has 2 divisors, whose sum is σ = 21012101211030. Its totient is φ = 21012101211028.
The previous prime is 21012101211007. The next prime is 21012101211089. The reversal of 21012101211029 is 92011210121012.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 17569703374129 + 3442397836900 = 4191623^2 + 1855370^2 .
It is a cyclic number.
It is not a de Polignac number, because 21012101211029 - 28 = 21012101210773 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21012101210995 and 21012101211013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21012101211089) 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, 10506050605514 + 10506050605515.
It is an arithmetic number, because the mean of its divisors is an integer number (10506050605515).
Almost surely, 221012101211029 is an apocalyptic number.
It is an amenable number.
21012101211029 is a deficient number, since it is larger than the sum of its proper divisors (1).
21012101211029 is an equidigital number, since it uses as much as digits as its factorization.
21012101211029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 23.
The spelling of 21012101211029 in words is "twenty-one trillion, twelve billion, one hundred one million, two hundred eleven thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •