Base | Representation |
---|---|
bin | 10010101000110000… |
… | …11001100000010000 |
3 | 221211022022222201200 |
4 | 21110120121200100 |
5 | 130442414213111 |
6 | 4332503031200 |
7 | 502643224020 |
oct | 112430314020 |
9 | 27738288650 |
10 | 10005616656 |
11 | 4274a00982 |
12 | 1b32a3b500 |
13 | c35c05b39 |
14 | 6acbc5a80 |
15 | 3d861c256 |
hex | 254619810 |
10005616656 has 120 divisors (see below), whose sum is σ = 33105708480. Its totient is φ = 2760162048.
The previous prime is 10005616633. The next prime is 10005616703. The reversal of 10005616656 is 65661650001.
It is a super-2 number, since 2×100056166562 (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 self number, because there is not a number n which added to its sum of digits gives 10005616656.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 141910 + ... + 200373.
It is an arithmetic number, because the mean of its divisors is an integer number (275880904).
Almost surely, 210005616656 is an apocalyptic number.
10005616656 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
10005616656 is an abundant number, since it is smaller than the sum of its proper divisors (23100091824).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10005616656 is a wasteful number, since it uses less digits than its factorization.
10005616656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 342333 (or 342324 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 36.
The spelling of 10005616656 in words is "ten billion, five million, six hundred sixteen thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •