Base | Representation |
---|---|
bin | 10011110000100000… |
… | …11011010001100000 |
3 | 1000101020220011102011 |
4 | 21320100123101200 |
5 | 133211010202103 |
6 | 4512323402304 |
7 | 523602214003 |
oct | 117020332140 |
9 | 30336804364 |
10 | 10607506528 |
11 | 455372a723 |
12 | 2080523394 |
13 | 10008139a8 |
14 | 728b0153a |
15 | 4213aed6d |
hex | 27841b460 |
10607506528 has 24 divisors (see below), whose sum is σ = 21791509488. Its totient is φ = 5073154944.
The previous prime is 10607506519. The next prime is 10607506537. The reversal of 10607506528 is 82560570601.
It is an interprime number because it is at equal distance from previous prime (10607506519) and next prime (10607506537).
It is a super-2 number, since 2×106075065282 (a number of 21 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7205451 + ... + 7206922.
It is an arithmetic number, because the mean of its divisors is an integer number (907979562).
Almost surely, 210607506528 is an apocalyptic number.
It is an amenable number.
10607506528 is an abundant number, since it is smaller than the sum of its proper divisors (11184002960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10607506528 is a wasteful number, since it uses less digits than its factorization.
10607506528 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14412406 (or 14412398 counting only the distinct ones).
The product of its (nonzero) digits is 100800, while the sum is 40.
The spelling of 10607506528 in words is "ten billion, six hundred seven million, five hundred six thousand, five hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •