Base | Representation |
---|---|
bin | 1001100011001011111100… |
… | …00011101010100011100101 |
3 | 2202100121012202001001010022 |
4 | 10301211332003222203211 |
5 | 10223031412230000401 |
6 | 112355210245404525 |
7 | 4265133531525053 |
oct | 461457603524345 |
9 | 82317182031108 |
10 | 21000210000101 |
11 | 6767159086132 |
12 | 2431b93a09745 |
13 | b94407c28497 |
14 | 5285b652b1d3 |
15 | 2663e4c7e71b |
hex | 13197e0ea8e5 |
21000210000101 has 2 divisors, whose sum is σ = 21000210000102. Its totient is φ = 21000210000100.
The previous prime is 21000210000097. The next prime is 21000210000113. The reversal of 21000210000101 is 10100001200012.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19181123899876 + 1819086100225 = 4379626^2 + 1348735^2 .
It is a cyclic number.
It is not a de Polignac number, because 21000210000101 - 22 = 21000210000097 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21000210000001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10500105000050 + 10500105000051.
It is an arithmetic number, because the mean of its divisors is an integer number (10500105000051).
Almost surely, 221000210000101 is an apocalyptic number.
It is an amenable number.
21000210000101 is a deficient number, since it is larger than the sum of its proper divisors (1).
21000210000101 is an equidigital number, since it uses as much as digits as its factorization.
21000210000101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 21000210000101 its reverse (10100001200012), we get a palindrome (31100211200113).
The spelling of 21000210000101 in words is "twenty-one trillion, two hundred ten million, one hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •