Base | Representation |
---|---|
bin | 10011111101010101… |
… | …00101110000000000 |
3 | 1000122202012211210200 |
4 | 21332222211300000 |
5 | 133421021402410 |
6 | 4531124125200 |
7 | 526346145042 |
oct | 117652456000 |
9 | 30582184720 |
10 | 10715028480 |
11 | 45a9399542 |
12 | 20b0536800 |
13 | 1019b8c150 |
14 | 7390cda92 |
15 | 42aa4d3c0 |
hex | 27eaa5c00 |
10715028480 has 528 divisors, whose sum is σ = 41344552704. Its totient is φ = 2548039680.
The previous prime is 10715028371. The next prime is 10715028503. The reversal of 10715028480 is 8482051701.
10715028480 is a `hidden beast` number, since 1 + 0 + 7 + 150 + 28 + 480 = 666.
It is a super-2 number, since 2×107150284802 (a number of 21 digits) contains 22 as substring.
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 47 ways as a sum of consecutive naturals, for example, 18569952 + ... + 18570528.
Almost surely, 210715028480 is an apocalyptic number.
10715028480 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 10715028480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20672276352).
10715028480 is an abundant number, since it is smaller than the sum of its proper divisors (30629524224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10715028480 is a wasteful number, since it uses less digits than its factorization.
10715028480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 652 (or 631 counting only the distinct ones).
The product of its (nonzero) digits is 17920, while the sum is 36.
The spelling of 10715028480 in words is "ten billion, seven hundred fifteen million, twenty-eight thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •