Base | Representation |
---|---|
bin | 101110100100100010… |
… | …0101011111101100100 |
3 | 100120010212212020011010 |
4 | 1131021010223331210 |
5 | 3114310103310340 |
6 | 113535525542220 |
7 | 10140226533441 |
oct | 1351104537544 |
9 | 316125766133 |
10 | 100010213220 |
11 | 39461181485 |
12 | 17471274970 |
13 | 957a977378 |
14 | 4baa55c9c8 |
15 | 29050a5b80 |
hex | 174912bf64 |
100010213220 has 72 divisors (see below), whose sum is σ = 292238081856. Its totient is φ = 25506854912.
The previous prime is 100010213207. The next prime is 100010213249. The reversal of 100010213220 is 22312010001.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 100010213196 and 100010213205.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 11743684 + ... + 11752196.
It is an arithmetic number, because the mean of its divisors is an integer number (4058862248).
Almost surely, 2100010213220 is an apocalyptic number.
100010213220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100010213220 is an abundant number, since it is smaller than the sum of its proper divisors (192227868636).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100010213220 is an frugal number, since it uses more digits than its factorization.
100010213220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17061 (or 8546 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 100010213220 its reverse (22312010001), we get a palindrome (122322223221).
The spelling of 100010213220 in words is "one hundred billion, ten million, two hundred thirteen thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •