Base | Representation |
---|---|
bin | 11000001001101011… |
… | …00101101001000000 |
3 | 1020110121221000120010 |
4 | 30010311211221000 |
5 | 203023302333220 |
6 | 5542335344520 |
7 | 636211452000 |
oct | 140465455100 |
9 | 36417830503 |
10 | 12966058560 |
11 | 5554002784 |
12 | 261a382140 |
13 | 12b8349a00 |
14 | 8b0052000 |
15 | 50d49a1e0 |
hex | 304d65a40 |
12966058560 has 672 divisors, whose sum is σ = 52208582400. Its totient is φ = 2723954688.
The previous prime is 12966058507. The next prime is 12966058597. The reversal of 12966058560 is 6585066921.
It is a tau number, because it is divible by the number of its divisors (672).
It is a Harshad number since it is a multiple of its sum of digits (48).
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 95 ways as a sum of consecutive naturals, for example, 55648204 + ... + 55648436.
Almost surely, 212966058560 is an apocalyptic number.
12966058560 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 12966058560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26104291200).
12966058560 is an abundant number, since it is smaller than the sum of its proper divisors (39242523840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12966058560 is a wasteful number, since it uses less digits than its factorization.
12966058560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 300 (or 263 counting only the distinct ones).
The product of its (nonzero) digits is 777600, while the sum is 48.
The spelling of 12966058560 in words is "twelve billion, nine hundred sixty-six million, fifty-eight thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •