Base | Representation |
---|---|
bin | 101110100100100110… |
… | …0010001000100011100 |
3 | 100120011000121011210201 |
4 | 1131021030101010130 |
5 | 3114311110401340 |
6 | 113540040313244 |
7 | 10140252450442 |
oct | 1351114210434 |
9 | 316130534721 |
10 | 100012200220 |
11 | 39462309329 |
12 | 17471a72824 |
13 | 957b1c18ca |
14 | 4baa918b92 |
15 | 290534979a |
hex | 174931111c |
100012200220 has 96 divisors (see below), whose sum is σ = 216507307968. Its totient is φ = 38794493952.
The previous prime is 100012200199. The next prime is 100012200221. The reversal of 100012200220 is 22002210001.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 100012200197 and 100012200206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100012200221) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 21399804 + ... + 21404476.
It is an arithmetic number, because the mean of its divisors is an integer number (2255284458).
Almost surely, 2100012200220 is an apocalyptic number.
100012200220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100012200220 is an abundant number, since it is smaller than the sum of its proper divisors (116495107748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100012200220 is a wasteful number, since it uses less digits than its factorization.
100012200220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4999 (or 4997 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 10.
Adding to 100012200220 its reverse (22002210001), we get a palindrome (122014410221).
The spelling of 100012200220 in words is "one hundred billion, twelve million, two hundred thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •