Base | Representation |
---|---|
bin | 11000001001000010… |
… | …00111010000000000 |
3 | 1020110020211022221000 |
4 | 30010201013100000 |
5 | 203020414104300 |
6 | 5542024332000 |
7 | 636115025502 |
oct | 140441072000 |
9 | 36406738830 |
10 | 12960691200 |
11 | 5550a77146 |
12 | 2618614000 |
13 | 12b71ba962 |
14 | 8ad455d72 |
15 | 50cc89c00 |
hex | 304847400 |
12960691200 has 528 divisors, whose sum is σ = 50440700160. Its totient is φ = 3249930240.
The previous prime is 12960691193. The next prime is 12960691201. The reversal of 12960691200 is 219606921.
12960691200 is a `hidden beast` number, since 1 + 29 + 606 + 9 + 1 + 20 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12960691201) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 11749849 + ... + 11750951.
Almost surely, 212960691200 is an apocalyptic number.
12960691200 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 12960691200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25220350080).
12960691200 is an abundant number, since it is smaller than the sum of its proper divisors (37480008960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12960691200 is a wasteful number, since it uses less digits than its factorization.
12960691200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1159 (or 1130 counting only the distinct ones).
The product of its (nonzero) digits is 11664, while the sum is 36.
The spelling of 12960691200 in words is "twelve billion, nine hundred sixty million, six hundred ninety-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •