Base | Representation |
---|---|
bin | 1001001001010101100001… |
… | …01011101001010010101100 |
3 | 2122012200120221022110112220 |
4 | 10210222300223221102230 |
5 | 10114003334241024322 |
6 | 110435154210355340 |
7 | 4144021064532543 |
oct | 444526053512254 |
9 | 78180527273486 |
10 | 20112001111212 |
11 | 64544a734366a |
12 | 2309a1058bb50 |
13 | b2b7272569ca |
14 | 4d75d710915a |
15 | 24d25c9b055c |
hex | 124ab0ae94ac |
20112001111212 has 24 divisors (see below), whose sum is σ = 46928189915376. Its totient is φ = 6703973610048.
The previous prime is 20112001111133. The next prime is 20112001111243. The reversal of 20112001111212 is 21211110021102.
It is a happy number.
20112001111212 is digitally balanced in base 5, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 20112001111191 and 20112001111200.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 86583 + ... + 6342830.
It is an arithmetic number, because the mean of its divisors is an integer number (1955341246474).
Almost surely, 220112001111212 is an apocalyptic number.
It is an amenable number.
20112001111212 is an abundant number, since it is smaller than the sum of its proper divisors (26816188804164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20112001111212 is a wasteful number, since it uses less digits than its factorization.
20112001111212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6690097 (or 6690095 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 20112001111212 its reverse (21211110021102), we get a palindrome (41323111132314).
The spelling of 20112001111212 in words is "twenty trillion, one hundred twelve billion, one million, one hundred eleven thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •