Base | Representation |
---|---|
bin | 10010110010010011… |
… | …11101000001110000 |
3 | 222000220001110111000 |
4 | 21121021331001300 |
5 | 131123420403310 |
6 | 4344443522000 |
7 | 504635113026 |
oct | 113111750160 |
9 | 28026043430 |
10 | 10085716080 |
11 | 430613a850 |
12 | 1b55829300 |
13 | c4969c54b |
14 | 6b96b6716 |
15 | 3e06904c0 |
hex | 25927d070 |
10085716080 has 320 divisors, whose sum is σ = 39123210240. Its totient is φ = 2365977600.
The previous prime is 10085716079. The next prime is 10085716093. The reversal of 10085716080 is 8061758001.
10085716080 is a `hidden beast` number, since 1 + 0 + 0 + 8 + 571 + 6 + 0 + 80 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 729714 + ... + 743406.
It is an arithmetic number, because the mean of its divisors is an integer number (122260032).
Almost surely, 210085716080 is an apocalyptic number.
10085716080 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10085716080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19561605120).
10085716080 is an abundant number, since it is smaller than the sum of its proper divisors (29037494160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10085716080 is a wasteful number, since it uses less digits than its factorization.
10085716080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13757 (or 13745 counting only the distinct ones).
The product of its (nonzero) digits is 13440, while the sum is 36.
The spelling of 10085716080 in words is "ten billion, eighty-five million, seven hundred sixteen thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •