Base | Representation |
---|---|
bin | 101111110000000100111011… |
… | …010000101011010110001111 |
3 | 1000112120221201001222121111102 |
4 | 233300010323100223112033 |
5 | 210011314044041200421 |
6 | 2022354104024413315 |
7 | 62143603250103212 |
oct | 5760047320532617 |
9 | 1015527631877442 |
10 | 210012010100111 |
11 | 60a0965877733a |
12 | 1b67989931723b |
13 | 90250806a71cb |
14 | 39c08c7c3d779 |
15 | 1942d6359a60b |
hex | bf013b42b58f |
210012010100111 has 4 divisors (see below), whose sum is σ = 210012127759224. Its totient is φ = 210011892441000.
The previous prime is 210012010100077. The next prime is 210012010100117. The reversal of 210012010100111 is 111001010210012.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 210012010100111 - 230 = 210010936358287 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 210012010100092 and 210012010100101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210012010100117) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 56110280 + ... + 59735981.
It is an arithmetic number, because the mean of its divisors is an integer number (52503031939806).
Almost surely, 2210012010100111 is an apocalyptic number.
210012010100111 is a deficient number, since it is larger than the sum of its proper divisors (117659113).
210012010100111 is a wasteful number, since it uses less digits than its factorization.
210012010100111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117659112.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 210012010100111 its reverse (111001010210012), we get a palindrome (321013020310123).
The spelling of 210012010100111 in words is "two hundred ten trillion, twelve billion, ten million, one hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •