Base | Representation |
---|---|
bin | 101110100100111001… |
… | …0011111010011101100 |
3 | 100120011201110020101010 |
4 | 1131021302133103230 |
5 | 3114321142020022 |
6 | 113541035145220 |
7 | 10140433561611 |
oct | 1351162372354 |
9 | 316151406333 |
10 | 100022220012 |
11 | 39467a32350 |
12 | 174752a5210 |
13 | 95802bc490 |
14 | 4babda6508 |
15 | 290617850c |
hex | 1749c9f4ec |
100022220012 has 96 divisors (see below), whose sum is σ = 274262204160. Its totient is φ = 27970548480.
The previous prime is 100022219971. The next prime is 100022220043. The reversal of 100022220012 is 210022220001.
It is a super-2 number, since 2×1000222200122 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a self number, because there is not a number n which added to its sum of digits gives 100022220012.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9558039 + ... + 9568497.
It is an arithmetic number, because the mean of its divisors is an integer number (2856897960).
Almost surely, 2100022220012 is an apocalyptic number.
100022220012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
100022220012 is an abundant number, since it is smaller than the sum of its proper divisors (174239984148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100022220012 is a wasteful number, since it uses less digits than its factorization.
100022220012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16063 (or 16061 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 100022220012 its reverse (210022220001), we get a palindrome (310044440013).
The spelling of 100022220012 in words is "one hundred billion, twenty-two million, two hundred twenty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •