Base | Representation |
---|---|
bin | 1001010010010111101011… |
… | …1101100001010001011100 |
3 | 1100011011220002200120001211 |
4 | 2110211322331201101130 |
5 | 2314300014223210022 |
6 | 33414543254314204 |
7 | 2102510026454644 |
oct | 224457275412134 |
9 | 40134802616054 |
10 | 10211200210012 |
11 | 328760034982a |
12 | 118abba358964 |
13 | 590bb1a00aa9 |
14 | 274320919524 |
15 | 12a93b802e77 |
hex | 9497af6145c |
10211200210012 has 48 divisors (see below), whose sum is σ = 17972902088064. Its totient is φ = 5076172800000.
The previous prime is 10211200210007. The next prime is 10211200210049. The reversal of 10211200210012 is 21001200211201.
10211200210012 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×102112002100122 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10211200209974 and 10211200210001.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2552160012 + ... + 2552164012.
It is an arithmetic number, because the mean of its divisors is an integer number (374435460168).
Almost surely, 210211200210012 is an apocalyptic number.
It is an amenable number.
10211200210012 is a deficient number, since it is larger than the sum of its proper divisors (7761701878052).
10211200210012 is a wasteful number, since it uses less digits than its factorization.
10211200210012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8590 (or 8588 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 10211200210012 its reverse (21001200211201), we get a palindrome (31212400421213).
The spelling of 10211200210012 in words is "ten trillion, two hundred eleven billion, two hundred million, two hundred ten thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •