Base | Representation |
---|---|
bin | 11001010010011101101100… |
… | …101001101101001000011100 |
3 | 112120210112021002200001211211 |
4 | 121102131230221231020130 |
5 | 104034212030224031022 |
6 | 1032313432455154204 |
7 | 32266244210112040 |
oct | 3122355451551034 |
9 | 476715232601754 |
10 | 111220001002012 |
11 | 32490157080111 |
12 | 10583221375964 |
13 | 4a0a002524ba6 |
14 | 1d67110932020 |
15 | ccd14a2b5e77 |
hex | 65276ca6d21c |
111220001002012 has 48 divisors (see below), whose sum is σ = 222917419291392. Its totient is φ = 47563507336320.
The previous prime is 111220001001983. The next prime is 111220001002031. The reversal of 111220001002012 is 210200100022111.
It is a junction number, because it is equal to n+sod(n) for n = 111220001001983 and 111220001002001.
It is a congruent number.
It is an unprimeable number.
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, 25719963 + ... + 29731405.
It is an arithmetic number, because the mean of its divisors is an integer number (4644112901904).
Almost surely, 2111220001002012 is an apocalyptic number.
It is an amenable number.
111220001002012 is an abundant number, since it is smaller than the sum of its proper divisors (111697418289380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111220001002012 is a wasteful number, since it uses less digits than its factorization.
111220001002012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4013578 (or 4013576 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 111220001002012 its reverse (210200100022111), we get a palindrome (321420101024123).
The spelling of 111220001002012 in words is "one hundred eleven trillion, two hundred twenty billion, one million, two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •