Base | Representation |
---|---|
bin | 11101001000100001111… |
… | …10100101000011010000 |
3 | 10112200210021002112102211 |
4 | 32210100332211003100 |
5 | 112400033112020422 |
6 | 2043505245521504 |
7 | 132215005324042 |
oct | 16442076450320 |
9 | 3480707075384 |
10 | 1001012220112 |
11 | 356588335943 |
12 | 142004b73294 |
13 | 73519bc3c58 |
14 | 36640a55a92 |
15 | 1b08a55d577 |
hex | e910fa50d0 |
1001012220112 has 20 divisors (see below), whose sum is σ = 1942300818720. Its totient is φ = 499773299168.
The previous prime is 1001012220083. The next prime is 1001012220139. The reversal of 1001012220112 is 2110222101001.
It is a super-3 number, since 3×10010122201123 (a number of 37 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1001012220092 and 1001012220101.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 45789412 + ... + 45811267.
It is an arithmetic number, because the mean of its divisors is an integer number (97115040936).
Almost surely, 21001012220112 is an apocalyptic number.
It is an amenable number.
1001012220112 is a deficient number, since it is larger than the sum of its proper divisors (941288598608).
1001012220112 is an equidigital number, since it uses as much as digits as its factorization.
1001012220112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91601370 (or 91601364 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1001012220112 its reverse (2110222101001), we get a palindrome (3111234321113).
The spelling of 1001012220112 in words is "one trillion, one billion, twelve million, two hundred twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.365 sec. • engine limits •