Base | Representation |
---|---|
bin | 101111110001100010001001… |
… | …001001100101000110111001 |
3 | 1000112221112001120212202010012 |
4 | 233301202021021211012321 |
5 | 210014434040341011301 |
6 | 2022512100002231305 |
7 | 62154045510462233 |
oct | 5761421111450671 |
9 | 1015845046782105 |
10 | 210112101110201 |
11 | 60a48050513694 |
12 | 1b695171655535 |
13 | 9031642000574 |
14 | 39c56a0dd1253 |
15 | 19457707b0ebb |
hex | bf18892651b9 |
210112101110201 has 16 divisors (see below), whose sum is σ = 228957317160000. Its totient is φ = 192055160154816.
The previous prime is 210112101110101. The next prime is 210112101110213. The reversal of 210112101110201 is 102011101211012.
It is a cyclic number.
It is not a de Polignac number, because 210112101110201 - 234 = 210094921241017 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (210112101110221) 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 in 15 ways as a sum of consecutive naturals, for example, 132637631 + ... + 134212388.
It is an arithmetic number, because the mean of its divisors is an integer number (14309832322500).
Almost surely, 2210112101110201 is an apocalyptic number.
It is an amenable number.
210112101110201 is a deficient number, since it is larger than the sum of its proper divisors (18845216049799).
210112101110201 is a wasteful number, since it uses less digits than its factorization.
210112101110201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 266851496.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 210112101110201 its reverse (102011101211012), we get a palindrome (312123202321213).
The spelling of 210112101110201 in words is "two hundred ten trillion, one hundred twelve billion, one hundred one million, one hundred ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •