Base | Representation |
---|---|
bin | 10111011000010111… |
… | …10100110000100101 |
3 | 1012101210122220020012 |
4 | 23230023310300211 |
5 | 201201412113003 |
6 | 5433322420005 |
7 | 623030061200 |
oct | 135413646045 |
9 | 35353586205 |
10 | 12552457253 |
11 | 5361597a16 |
12 | 2523961605 |
13 | 12507555cb |
14 | 87114a937 |
15 | 4d6eeb8d8 |
hex | 2ec2f4c25 |
12552457253 has 12 divisors (see below), whose sum is σ = 15236701920. Its totient is φ = 10291454712.
The previous prime is 12552457241. The next prime is 12552457259. The reversal of 12552457253 is 35275425521.
12552457253 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 12552457253 - 28 = 12552456997 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 12552457253.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12552457259) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5567843 + ... + 5570096.
It is an arithmetic number, because the mean of its divisors is an integer number (1269725160).
Almost surely, 212552457253 is an apocalyptic number.
It is an amenable number.
12552457253 is a deficient number, since it is larger than the sum of its proper divisors (2684244667).
12552457253 is a wasteful number, since it uses less digits than its factorization.
12552457253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11137976 (or 11137969 counting only the distinct ones).
The product of its digits is 420000, while the sum is 41.
The spelling of 12552457253 in words is "twelve billion, five hundred fifty-two million, four hundred fifty-seven thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •