Base | Representation |
---|---|
bin | 10111101011000001… |
… | …01010111011100000 |
3 | 1012210201001212121011 |
4 | 23311200222323200 |
5 | 202011440320320 |
6 | 5501032110304 |
7 | 626640004015 |
oct | 136540527340 |
9 | 35721055534 |
10 | 12708916960 |
11 | 5431941463 |
12 | 2568235394 |
13 | 1276ca680c |
14 | 887c3770c |
15 | 4e5b0505a |
hex | 2f582aee0 |
12708916960 has 24 divisors (see below), whose sum is σ = 30024816696. Its totient is φ = 5083566720.
The previous prime is 12708916951. The next prime is 12708916981. The reversal of 12708916960 is 6961980721.
12708916960 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Smith number, since the sum of its digits (49) 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 (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 39715206 + ... + 39715525.
It is an arithmetic number, because the mean of its divisors is an integer number (1251034029).
Almost surely, 212708916960 is an apocalyptic number.
12708916960 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12708916960 is an abundant number, since it is smaller than the sum of its proper divisors (17315899736).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12708916960 is an equidigital number, since it uses as much as digits as its factorization.
12708916960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79430746 (or 79430738 counting only the distinct ones).
The product of its (nonzero) digits is 326592, while the sum is 49.
The spelling of 12708916960 in words is "twelve billion, seven hundred eight million, nine hundred sixteen thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •