Base | Representation |
---|---|
bin | 11000000011010010… |
… | …10001110101111000 |
3 | 1020022220010222011000 |
4 | 30001221101311320 |
5 | 202421100000323 |
6 | 5533143405000 |
7 | 634661303565 |
oct | 140151216570 |
9 | 36286128130 |
10 | 12912500088 |
11 | 5526851484 |
12 | 2604453760 |
13 | 12aa2169c7 |
14 | 8a6cad86c |
15 | 50891ae43 |
hex | 301a51d78 |
12912500088 has 128 divisors (see below), whose sum is σ = 36211968000. Its totient is φ = 4263114240.
The previous prime is 12912500063. The next prime is 12912500089. The reversal of 12912500088 is 88000521921.
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 (12912500089) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 13029273 + ... + 13030263.
It is an arithmetic number, because the mean of its divisors is an integer number (282906000).
Almost surely, 212912500088 is an apocalyptic number.
12912500088 is a gapful number since it is divisible by the number (18) 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 12912500088, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18105984000).
12912500088 is an abundant number, since it is smaller than the sum of its proper divisors (23299467912).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12912500088 is a wasteful number, since it uses less digits than its factorization.
12912500088 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1522 (or 1512 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 36.
The spelling of 12912500088 in words is "twelve billion, nine hundred twelve million, five hundred thousand, eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •