Base | Representation |
---|---|
bin | 11000000010101010… |
… | …01011101101100100 |
3 | 1020022112020022211100 |
4 | 30001111023231210 |
5 | 202413222411400 |
6 | 5532434440100 |
7 | 634565443200 |
oct | 140125135544 |
9 | 36275208740 |
10 | 12907232100 |
11 | 5523883574 |
12 | 2602733030 |
13 | 12a90c0c59 |
14 | 8a62dbb00 |
15 | 50822a100 |
hex | 30154bb64 |
12907232100 has 243 divisors, whose sum is σ = 47149378731. Its totient is φ = 2944771200.
The previous prime is 12907232083. The next prime is 12907232183. The reversal of 12907232100 is 123270921.
The square root of 12907232100 is 113610.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 761428836 + 12145803264 = 27594^2 + 110208^2 .
It is a hoax number, since the sum of its digits (27) coincides with the sum of the digits of its distinct prime factors.
It is an unprimeable number.
It is a polite number, since it can be written in 80 ways as a sum of consecutive naturals, for example, 23857830 + ... + 23858370.
Almost surely, 212907232100 is an apocalyptic number.
12907232100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12907232100 is the 113610-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12907232100
12907232100 is an abundant number, since it is smaller than the sum of its proper divisors (34242146631).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12907232100 is a wasteful number, since it uses less digits than its factorization.
12907232100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1116 (or 558 counting only the distinct ones).
The product of its (nonzero) digits is 1512, while the sum is 27.
The spelling of 12907232100 in words is "twelve billion, nine hundred seven million, two hundred thirty-two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •