Base | Representation |
---|---|
bin | 1011111011011… |
… | …00101101101000 |
3 | 20222021120112020 |
4 | 11331230231220 |
5 | 201103410013 |
6 | 13532344440 |
7 | 2323332066 |
oct | 575545550 |
9 | 228246466 |
10 | 100060008 |
11 | 51532624 |
12 | 29615120 |
13 | 17964c09 |
14 | d409036 |
15 | 8bb7623 |
hex | 5f6cb68 |
100060008 has 64 divisors (see below), whose sum is σ = 260608320. Its totient is φ = 31987200.
The previous prime is 100060003. The next prime is 100060013. The reversal of 100060008 is 800060001.
It is a Cunningham number, because it is equal to 100032-1.
It is an interprime number because it is at equal distance from previous prime (100060003) and next prime (100060013).
It is not an unprimeable number, because it can be changed into a prime (100060001) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 59191 + ... + 60857.
It is an arithmetic number, because the mean of its divisors is an integer number (4072005).
Almost surely, 2100060008 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 100060008, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (130304160).
100060008 is an abundant number, since it is smaller than the sum of its proper divisors (160548312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100060008 is a wasteful number, since it uses less digits than its factorization.
100060008 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1778 (or 1774 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
The square root of 100060008 is about 10002.9999500150. Note that the first 4 decimals coincide. The cubic root of 100060008 is about 464.2517089504.
The spelling of 100060008 in words is "one hundred million, sixty thousand, eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •