Base | Representation |
---|---|
bin | 101110110011001000… |
… | …1011110011100101000 |
3 | 100121102000200022100010 |
4 | 1131212101132130220 |
5 | 3121311011330000 |
6 | 114100310011520 |
7 | 10155325540401 |
oct | 1354621363450 |
9 | 317360608303 |
10 | 100500105000 |
11 | 39692764419 |
12 | 17589346ba0 |
13 | 9628300569 |
14 | 4c156429a8 |
15 | 29330c3d50 |
hex | 176645e728 |
100500105000 has 80 divisors (see below), whose sum is σ = 313962374880. Its totient is φ = 26800024000.
The previous prime is 100500104987. The next prime is 100500105023. The reversal of 100500105000 is 501005001.
It is a super-2 number, since 2×1005001050002 (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 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 19 ways as a sum of consecutive naturals, for example, 3335004 + ... + 3365003.
It is an arithmetic number, because the mean of its divisors is an integer number (3924529686).
Almost surely, 2100500105000 is an apocalyptic number.
100500105000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100500105000 is an abundant number, since it is smaller than the sum of its proper divisors (213462269880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100500105000 is an equidigital number, since it uses as much as digits as its factorization.
100500105000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6700036 (or 6700017 counting only the distinct ones).
The product of its (nonzero) digits is 25, while the sum is 12.
Subtracting from 100500105000 its reverse (501005001), we obtain a palindrome (99999099999).
The spelling of 100500105000 in words is "one hundred billion, five hundred million, one hundred five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •