Base | Representation |
---|---|
bin | 101111110000000011000100… |
… | …101101010110111100010011 |
3 | 1000112120202120110101110102212 |
4 | 233300003010231112330103 |
5 | 210011301010402130003 |
6 | 2022353134414102335 |
7 | 62143503046120433 |
oct | 5760030455267423 |
9 | 1015522513343385 |
10 | 210010021130003 |
11 | 60a08827a83696 |
12 | 1b6794231aa9ab |
13 | 9024b245c2413 |
14 | 39c0779a162c3 |
15 | 1942c98b65dd8 |
hex | bf00c4b56f13 |
210010021130003 has 2 divisors, whose sum is σ = 210010021130004. Its totient is φ = 210010021130002.
The previous prime is 210010021129973. The next prime is 210010021130011. The reversal of 210010021130003 is 300031120010012.
210010021130003 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 210010021130003 - 210 = 210010021128979 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 210010021130003.
It is not a weakly prime, because it can be changed into another prime (210010021130023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105005010565001 + 105005010565002.
It is an arithmetic number, because the mean of its divisors is an integer number (105005010565002).
Almost surely, 2210010021130003 is an apocalyptic number.
210010021130003 is a deficient number, since it is larger than the sum of its proper divisors (1).
210010021130003 is an equidigital number, since it uses as much as digits as its factorization.
210010021130003 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 210010021130003 its reverse (300031120010012), we get a palindrome (510041141140015).
The spelling of 210010021130003 in words is "two hundred ten trillion, ten billion, twenty-one million, one hundred thirty thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •