Base | Representation |
---|---|
bin | 101110101000000111… |
… | …0000011101001000100 |
3 | 100120110020110121122100 |
4 | 1131100032003221010 |
5 | 3120031302010040 |
6 | 113555451432100 |
7 | 10143213615003 |
oct | 1352016035104 |
9 | 316406417570 |
10 | 100130110020 |
11 | 39512922746 |
12 | 174a5455630 |
13 | 9599766315 |
14 | 4bbc44cc3a |
15 | 291088ab30 |
hex | 1750383a44 |
100130110020 has 72 divisors (see below), whose sum is σ = 304202185560. Its totient is φ = 26659676160.
The previous prime is 100130110009. The next prime is 100130110037. The reversal of 100130110020 is 20011031001.
It can be written as a sum of positive squares in 4 ways, for example, as 21119646276 + 79010463744 = 145326^2 + 281088^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 100130109984 and 100130110011.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 318535 + ... + 549294.
It is an arithmetic number, because the mean of its divisors is an integer number (4225030355).
Almost surely, 2100130110020 is an apocalyptic number.
100130110020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100130110020 is an abundant number, since it is smaller than the sum of its proper divisors (204072075540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100130110020 is a wasteful number, since it uses less digits than its factorization.
100130110020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 868485 (or 868480 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 100130110020 its reverse (20011031001), we get a palindrome (120141141021).
The spelling of 100130110020 in words is "one hundred billion, one hundred thirty million, one hundred ten thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •