Base | Representation |
---|---|
bin | 11101001000100011000… |
… | …00111010010100010000 |
3 | 10112200210220000210010011 |
4 | 32210101200322110100 |
5 | 112400042413020422 |
6 | 2043510210444304 |
7 | 132215144660104 |
oct | 16442140722420 |
9 | 3480726023104 |
10 | 1001021220112 |
11 | 356592422761 |
12 | 142007b93694 |
13 | 7351ba255b4 |
14 | 36641d19904 |
15 | 1b08b23a077 |
hex | e91183a510 |
1001021220112 has 20 divisors (see below), whose sum is σ = 2023803771840. Its totient is φ = 478749279008.
The previous prime is 1001021220097. The next prime is 1001021220139. The reversal of 1001021220112 is 2110221201001.
It is a super-2 number, since 2×10010212201122 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1001021220092 and 1001021220101.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1360082812 + ... + 1360083547.
It is an arithmetic number, because the mean of its divisors is an integer number (101190188592).
Almost surely, 21001021220112 is an apocalyptic number.
It is an amenable number.
1001021220112 is an abundant number, since it is smaller than the sum of its proper divisors (1022782551728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1001021220112 is a wasteful number, since it uses less digits than its factorization.
1001021220112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2720166390 (or 2720166384 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1001021220112 its reverse (2110221201001), we get a palindrome (3111242421113).
The spelling of 1001021220112 in words is "one trillion, one billion, twenty-one million, two hundred twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •