Base | Representation |
---|---|
bin | 1010001110111010000000… |
… | …0010000101101101010101 |
3 | 1110211121022202202210111022 |
4 | 2203232200002011231111 |
5 | 2433314431242003303 |
6 | 35532422030250525 |
7 | 2240605221113336 |
oct | 243564002055525 |
9 | 43747282683438 |
10 | 11251204250453 |
11 | 3648677532372 |
12 | 1318685656a45 |
13 | 637ca3b34c7b |
14 | 2ac7bdca228d |
15 | 147a0a09d438 |
hex | a3ba0085b55 |
11251204250453 has 2 divisors, whose sum is σ = 11251204250454. Its totient is φ = 11251204250452.
The previous prime is 11251204250441. The next prime is 11251204250519. The reversal of 11251204250453 is 35405240215211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11187406078564 + 63798171889 = 3344758^2 + 252583^2 .
It is a cyclic number.
It is not a de Polignac number, because 11251204250453 - 26 = 11251204250389 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11251204250413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5625602125226 + 5625602125227.
It is an arithmetic number, because the mean of its divisors is an integer number (5625602125227).
Almost surely, 211251204250453 is an apocalyptic number.
It is an amenable number.
11251204250453 is a deficient number, since it is larger than the sum of its proper divisors (1).
11251204250453 is an equidigital number, since it uses as much as digits as its factorization.
11251204250453 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48000, while the sum is 35.
Adding to 11251204250453 its reverse (35405240215211), we get a palindrome (46656444465664).
The spelling of 11251204250453 in words is "eleven trillion, two hundred fifty-one billion, two hundred four million, two hundred fifty thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •