Base | Representation |
---|---|
bin | 10111010111011111… |
… | …10111111000101001 |
3 | 1012101021212122011101 |
4 | 23223233313320221 |
5 | 201143023130100 |
6 | 5432501401401 |
7 | 622610563051 |
oct | 135357677051 |
9 | 35337778141 |
10 | 12545130025 |
11 | 535844295a |
12 | 2521409261 |
13 | 124c08b47c |
14 | 8701a0561 |
15 | 4d655086a |
hex | 2ebbf7e29 |
12545130025 has 24 divisors (see below), whose sum is σ = 16485947064. Its totient is φ = 9437184000.
The previous prime is 12545130007. The next prime is 12545130029. The reversal of 12545130025 is 52003154521.
It can be written as a sum of positive squares in 12 ways, for example, as 296838441 + 12248291584 = 17229^2 + 110672^2 .
It is not a de Polignac number, because 12545130025 - 27 = 12545129897 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12545129975 and 12545130002.
It is not an unprimeable number, because it can be changed into a prime (12545130029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 477225 + ... + 502825.
It is an arithmetic number, because the mean of its divisors is an integer number (686914461).
Almost surely, 212545130025 is an apocalyptic number.
It is an amenable number.
12545130025 is a deficient number, since it is larger than the sum of its proper divisors (3940817039).
12545130025 is a wasteful number, since it uses less digits than its factorization.
12545130025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26781 (or 26776 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 28.
Adding to 12545130025 its reverse (52003154521), we get a palindrome (64548284546).
The spelling of 12545130025 in words is "twelve billion, five hundred forty-five million, one hundred thirty thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •