Base | Representation |
---|---|
bin | 10111010110000011… |
… | …00111000011010101 |
3 | 1012100110001111021001 |
4 | 23223001213003111 |
5 | 201131422034303 |
6 | 5431345423301 |
7 | 622402522516 |
oct | 135301470325 |
9 | 35313044231 |
10 | 12533002453 |
11 | 535160a274 |
12 | 251933ab31 |
13 | 12497033aa |
14 | 86c724a0d |
15 | 4d545731d |
hex | 2eb0670d5 |
12533002453 has 2 divisors, whose sum is σ = 12533002454. Its totient is φ = 12533002452.
The previous prime is 12533002399. The next prime is 12533002483. The reversal of 12533002453 is 35420033521.
12533002453 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11803084164 + 729918289 = 108642^2 + 27017^2 .
It is a cyclic number.
It is not a de Polignac number, because 12533002453 - 29 = 12533001941 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12533002483) 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 as a sum of consecutive naturals, namely, 6266501226 + 6266501227.
It is an arithmetic number, because the mean of its divisors is an integer number (6266501227).
Almost surely, 212533002453 is an apocalyptic number.
It is an amenable number.
12533002453 is a deficient number, since it is larger than the sum of its proper divisors (1).
12533002453 is an equidigital number, since it uses as much as digits as its factorization.
12533002453 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10800, while the sum is 28.
Adding to 12533002453 its reverse (35420033521), we get a palindrome (47953035974).
The spelling of 12533002453 in words is "twelve billion, five hundred thirty-three million, two thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •