Base | Representation |
---|---|
bin | 1001100011100001111001… |
… | …10111001110001101001101 |
3 | 2202101201122111010001100111 |
4 | 10301300330313032031031 |
5 | 10223230034241333401 |
6 | 112404440254200021 |
7 | 4266031655434114 |
oct | 461607467161515 |
9 | 82351574101314 |
10 | 21012001121101 |
11 | 677115993a931 |
12 | 24343247b3011 |
13 | b95566a17463 |
14 | 528db44d4c7b |
15 | 266884edee51 |
hex | 131c3cdce34d |
21012001121101 has 2 divisors, whose sum is σ = 21012001121102. Its totient is φ = 21012001121100.
The previous prime is 21012001121053. The next prime is 21012001121107. The reversal of 21012001121101 is 10112110021012.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16607858175076 + 4404142946025 = 4075274^2 + 2098605^2 .
It is a cyclic number.
It is not a de Polignac number, because 21012001121101 - 27 = 21012001120973 is a prime.
It is a super-2 number, since 2×210120011211012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21012001121107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10506000560550 + 10506000560551.
It is an arithmetic number, because the mean of its divisors is an integer number (10506000560551).
Almost surely, 221012001121101 is an apocalyptic number.
It is an amenable number.
21012001121101 is a deficient number, since it is larger than the sum of its proper divisors (1).
21012001121101 is an equidigital number, since it uses as much as digits as its factorization.
21012001121101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 21012001121101 its reverse (10112110021012), we get a palindrome (31124111142113).
The spelling of 21012001121101 in words is "twenty-one trillion, twelve billion, one million, one hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •