Base | Representation |
---|---|
bin | 1001010001110010011110… |
… | …1000010100111110101000 |
3 | 1100010020010000111122100122 |
4 | 2110130213220110332220 |
5 | 2314114040311223422 |
6 | 33410212221022412 |
7 | 2102004356045426 |
oct | 224344750247650 |
9 | 40106100448318 |
10 | 10201212211112 |
11 | 328334539138a |
12 | 11890913b4a08 |
13 | 58cc7c655c80 |
14 | 273a541dc116 |
15 | 12a554a15d42 |
hex | 94727a14fa8 |
10201212211112 has 64 divisors (see below), whose sum is σ = 22958193787200. Its totient is φ = 4198069693440.
The previous prime is 10201212211051. The next prime is 10201212211121. The reversal of 10201212211112 is 21111221210201.
It is a super-2 number, since 2×102012122111122 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
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, 151806314 + ... + 151873497.
It is an arithmetic number, because the mean of its divisors is an integer number (358721777925).
Almost surely, 210201212211112 is an apocalyptic number.
It is an amenable number.
10201212211112 is an abundant number, since it is smaller than the sum of its proper divisors (12756981576088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10201212211112 is a wasteful number, since it uses less digits than its factorization.
10201212211112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 303679866 (or 303679862 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 10201212211112 its reverse (21111221210201), we get a palindrome (31312433421313).
The spelling of 10201212211112 in words is "ten trillion, two hundred one billion, two hundred twelve million, two hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •