Base | Representation |
---|---|
bin | 10111010010101001… |
… | …00000000101100001 |
3 | 1012021110020100101021 |
4 | 23221110200011201 |
5 | 201102111301400 |
6 | 5424444405441 |
7 | 621604435222 |
oct | 135124400541 |
9 | 35243210337 |
10 | 12504400225 |
11 | 5337453a69 |
12 | 250b846881 |
13 | 12437ca6b5 |
14 | 8689db249 |
15 | 4d2ba771a |
hex | 2e9520161 |
12504400225 has 12 divisors (see below), whose sum is σ = 16179607296. Its totient is φ = 9568584080.
The previous prime is 12504400193. The next prime is 12504400229. The reversal of 12504400225 is 52200440521.
It is not a de Polignac number, because 12504400225 - 25 = 12504400193 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12504400225.
It is not an unprimeable number, because it can be changed into a prime (12504400229) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 10872817 + ... + 10873966.
It is an arithmetic number, because the mean of its divisors is an integer number (1348300608).
Almost surely, 212504400225 is an apocalyptic number.
It is an amenable number.
12504400225 is a deficient number, since it is larger than the sum of its proper divisors (3675207071).
12504400225 is a wasteful number, since it uses less digits than its factorization.
12504400225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21746816 (or 21746811 counting only the distinct ones).
The product of its (nonzero) digits is 3200, while the sum is 25.
Adding to 12504400225 its reverse (52200440521), we get a palindrome (64704840746).
The spelling of 12504400225 in words is "twelve billion, five hundred four million, four hundred thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •