Base | Representation |
---|---|
bin | 10110110100100110… |
… | …10001110000000101 |
3 | 1011121220002111001000 |
4 | 23122103101300011 |
5 | 200043104434000 |
6 | 5343443523513 |
7 | 612424601250 |
oct | 133223216005 |
9 | 34556074030 |
10 | 12252421125 |
11 | 521819937a |
12 | 245b389599 |
13 | 1203544239 |
14 | 843368097 |
15 | 4ba9d2000 |
hex | 2da4d1c05 |
12252421125 has 64 divisors (see below), whose sum is σ = 25889610240. Its totient is φ = 5601096000.
The previous prime is 12252421109. The next prime is 12252421157. The reversal of 12252421125 is 52112425221.
12252421125 is a `hidden beast` number, since 1 + 22 + 524 + 2 + 112 + 5 = 666.
It is not a de Polignac number, because 12252421125 - 24 = 12252421109 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 235686 + ... + 282935.
It is an arithmetic number, because the mean of its divisors is an integer number (404525160).
Almost surely, 212252421125 is an apocalyptic number.
12252421125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
12252421125 is an abundant number, since it is smaller than the sum of its proper divisors (13637189115).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12252421125 is an equidigital number, since it uses as much as digits as its factorization.
12252421125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 518652 (or 518636 counting only the distinct ones).
The product of its digits is 3200, while the sum is 27.
Adding to 12252421125 its reverse (52112425221), we get a palindrome (64364846346).
The spelling of 12252421125 in words is "twelve billion, two hundred fifty-two million, four hundred twenty-one thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •