Base | Representation |
---|---|
bin | 10110101111101010010000… |
… | …011010001100100101001100 |
3 | 111010011222121210012110122221 |
4 | 112233222100122030211030 |
5 | 101102411432021011340 |
6 | 552430055142345124 |
7 | 30033042305102464 |
oct | 2657522032144514 |
9 | 433158553173587 |
10 | 100032211110220 |
11 | 29967471379024 |
12 | b276ab512b1a4 |
13 | 43a7cc662c68c |
14 | 1a9b828b8aba4 |
15 | b871025ac44a |
hex | 5afa9068c94c |
100032211110220 has 12 divisors (see below), whose sum is σ = 210067643331504. Its totient is φ = 40012884444080.
The previous prime is 100032211110217. The next prime is 100032211110259. The reversal of 100032211110220 is 22011112230001.
It is a junction number, because it is equal to n+sod(n) for n = 100032211110194 and 100032211110203.
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, 2500805277736 + ... + 2500805277775.
It is an arithmetic number, because the mean of its divisors is an integer number (17505636944292).
Almost surely, 2100032211110220 is an apocalyptic number.
100032211110220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100032211110220 is an abundant number, since it is smaller than the sum of its proper divisors (110035432221284).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100032211110220 is a wasteful number, since it uses less digits than its factorization.
100032211110220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5001610555520 (or 5001610555518 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 100032211110220 its reverse (22011112230001), we get a palindrome (122043323340221).
The spelling of 100032211110220 in words is "one hundred trillion, thirty-two billion, two hundred eleven million, one hundred ten thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •