Base | Representation |
---|---|
bin | 1001010010010110111111… |
… | …0000010110110101010001 |
3 | 1100011011101222221011112110 |
4 | 2110211233300112311101 |
5 | 2314244123111210001 |
6 | 33414512501015533 |
7 | 2102502254466651 |
oct | 224455760266521 |
9 | 40134358834473 |
10 | 10211012210001 |
11 | 3287514212619 |
12 | 118ab673b45a9 |
13 | 590b81a88795 |
14 | 27430397c361 |
15 | 12a92a0693d6 |
hex | 9496fc16d51 |
10211012210001 has 32 divisors (see below), whose sum is σ = 14057305694208. Its totient is φ = 6588001978560.
The previous prime is 10211012209999. The next prime is 10211012210023. The reversal of 10211012210001 is 10001221011201.
10211012210001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10211012210001 - 21 = 10211012209999 is a prime.
It is a super-2 number, since 2×102110122100012 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10211012210041) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 279559326 + ... + 279595848.
It is an arithmetic number, because the mean of its divisors is an integer number (439290802944).
Almost surely, 210211012210001 is an apocalyptic number.
It is an amenable number.
10211012210001 is a deficient number, since it is larger than the sum of its proper divisors (3846293484207).
10211012210001 is a wasteful number, since it uses less digits than its factorization.
10211012210001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49941.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 10211012210001 its reverse (10001221011201), we get a palindrome (20212233221202).
The spelling of 10211012210001 in words is "ten trillion, two hundred eleven billion, twelve million, two hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •