Base | Representation |
---|---|
bin | 10110100101101101… |
… | …10011001111101001 |
3 | 1011022012001121220101 |
4 | 23102312303033221 |
5 | 144314121000000 |
6 | 5323222425401 |
7 | 606350116261 |
oct | 132266631751 |
9 | 34265047811 |
10 | 12127515625 |
11 | 5163736a95 |
12 | 2425592261 |
13 | 11b36c0564 |
14 | 8309327a1 |
15 | 4aea5ce6a |
hex | 2d2db33e9 |
12127515625 has 21 divisors (see below), whose sum is σ = 15176426833. Its totient is φ = 9691000000.
The previous prime is 12127515613. The next prime is 12127515637. The reversal of 12127515625 is 52651572121.
The square root of 12127515625 is 110125.
It is a perfect power (a square), and thus also a powerful number.
It is an interprime number because it is at equal distance from previous prime (12127515613) and next prime (12127515637).
It can be written as a sum of positive squares in 10 ways, for example, as 6142327129 + 5985188496 = 78373^2 + 77364^2 .
It is not a de Polignac number, because 12127515625 - 213 = 12127507433 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 20 ways as a sum of consecutive naturals, for example, 13765185 + ... + 13766065.
Almost surely, 212127515625 is an apocalyptic number.
12127515625 is the 110125-th square number.
12127515625 is the 55063-rd centered octagonal number.
It is an amenable number.
12127515625 is a deficient number, since it is larger than the sum of its proper divisors (3048911208).
12127515625 is an frugal number, since it uses more digits than its factorization.
12127515625 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1792 (or 886 counting only the distinct ones).
The product of its digits is 42000, while the sum is 37.
It can be divided in two parts, 121275 and 15625, that added together give a square (136900 = 3702).
The spelling of 12127515625 in words is "twelve billion, one hundred twenty-seven million, five hundred fifteen thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •