Base | Representation |
---|---|
bin | 1001000111010011100101… |
… | …0011000110101111001011 |
3 | 1022111000021002020222121211 |
4 | 2101310321103012233023 |
5 | 2303141223210324321 |
6 | 33151350004113551 |
7 | 2053000460441101 |
oct | 221647123065713 |
9 | 38430232228554 |
10 | 10021120011211 |
11 | 3213a29aa6041 |
12 | 115a1b09958b7 |
13 | 578cab89c38a |
14 | 26904c081c71 |
15 | 125a141990e1 |
hex | 91d394c6bcb |
10021120011211 has 2 divisors, whose sum is σ = 10021120011212. Its totient is φ = 10021120011210.
The previous prime is 10021120011193. The next prime is 10021120011271. The reversal of 10021120011211 is 11211002112001.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (11211002112001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10021120011211 - 27 = 10021120011083 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10021120011191 and 10021120011200.
It is not a weakly prime, because it can be changed into another prime (10021120011271) 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, 5010560005605 + 5010560005606.
It is an arithmetic number, because the mean of its divisors is an integer number (5010560005606).
Almost surely, 210021120011211 is an apocalyptic number.
10021120011211 is a deficient number, since it is larger than the sum of its proper divisors (1).
10021120011211 is an equidigital number, since it uses as much as digits as its factorization.
10021120011211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 10021120011211 its reverse (11211002112001), we get a palindrome (21232122123212).
The spelling of 10021120011211 in words is "ten trillion, twenty-one billion, one hundred twenty million, eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •