Base | Representation |
---|---|
bin | 1001001011111101001010… |
… | …0001000111110100001101 |
3 | 1022202122110001120102022022 |
4 | 2102333102201013310031 |
5 | 2310443322000323041 |
6 | 33252200233455525 |
7 | 2061526124310653 |
oct | 222772241076415 |
9 | 38678401512268 |
10 | 10101000011021 |
11 | 32448a01a0207 |
12 | 11717845715a5 |
13 | 58369bbaa15a |
14 | 26cc68d00dd3 |
15 | 127b3bd6224b |
hex | 92fd2847d0d |
10101000011021 has 2 divisors, whose sum is σ = 10101000011022. Its totient is φ = 10101000011020.
The previous prime is 10101000011017. The next prime is 10101000011027. The reversal of 10101000011021 is 12011000010101.
It is a happy number.
10101000011021 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7133632024996 + 2967367986025 = 2670886^2 + 1722605^2 .
It is a cyclic number.
It is not a de Polignac number, because 10101000011021 - 22 = 10101000011017 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10101000011027) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050500005510 + 5050500005511.
It is an arithmetic number, because the mean of its divisors is an integer number (5050500005511).
Almost surely, 210101000011021 is an apocalyptic number.
It is an amenable number.
10101000011021 is a deficient number, since it is larger than the sum of its proper divisors (1).
10101000011021 is an equidigital number, since it uses as much as digits as its factorization.
10101000011021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 10101000011021 its reverse (12011000010101), we get a palindrome (22112000021122).
The spelling of 10101000011021 in words is "ten trillion, one hundred one billion, eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •