Base | Representation |
---|---|
bin | 11001011101110100001001… |
… | …011010001000001011111100 |
3 | 112200120002121222001212010011 |
4 | 121131310021122020023330 |
5 | 104140002020111201022 |
6 | 1034112033205553004 |
7 | 32406506622305053 |
oct | 3135641132101374 |
9 | 480502558055104 |
10 | 112000020022012 |
11 | 32760a3a5168a1 |
12 | 1068a430115764 |
13 | 4a65730a25c75 |
14 | 1d92b8932339a |
15 | ce359e347977 |
hex | 65dd096882fc |
112000020022012 has 24 divisors (see below), whose sum is σ = 197974335112400. Its totient is φ = 55436839261056.
The previous prime is 112000020022001. The next prime is 112000020022013. The reversal of 112000020022012 is 210220020000211.
It is a happy number.
112000020022012 is digitally balanced in base 3, 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 = 112000020021983 and 112000020022001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112000020022013) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 113882937 + ... + 114862192.
Almost surely, 2112000020022012 is an apocalyptic number.
It is an amenable number.
112000020022012 is a deficient number, since it is larger than the sum of its proper divisors (85974315090388).
112000020022012 is a wasteful number, since it uses less digits than its factorization.
112000020022012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 228746365 (or 228746363 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 112000020022012 its reverse (210220020000211), we get a palindrome (322220040022223).
The spelling of 112000020022012 in words is "one hundred twelve trillion, twenty million, twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •