Base | Representation |
---|---|
bin | 11101101011111100000… |
… | …11111100001000101000 |
3 | 10121111212002202010122120 |
4 | 32311332003330020220 |
5 | 113203001141223422 |
6 | 2100331451551240 |
7 | 133460046511242 |
oct | 16657603741050 |
9 | 3544762663576 |
10 | 1020022211112 |
11 | 363652a45503 |
12 | 14582b45b520 |
13 | 7525944c138 |
14 | 37525671092 |
15 | 1b7ee41d45c |
hex | ed7e0fc228 |
1020022211112 has 64 divisors (see below), whose sum is σ = 2744322120000. Its totient is φ = 314760944640.
The previous prime is 1020022211081. The next prime is 1020022211167. The reversal of 1020022211112 is 2111122200201.
It is a super-2 number, since 2×10200222111122 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1020022211091 and 1020022211100.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 20467362 + ... + 20517137.
It is an arithmetic number, because the mean of its divisors is an integer number (42880033125).
Almost surely, 21020022211112 is an apocalyptic number.
1020022211112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1020022211112 is an abundant number, since it is smaller than the sum of its proper divisors (1724299908888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1020022211112 is a wasteful number, since it uses less digits than its factorization.
1020022211112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40984586 (or 40984582 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1020022211112 its reverse (2111122200201), we get a palindrome (3131144411313).
The spelling of 1020022211112 in words is "one trillion, twenty billion, twenty-two million, two hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •