Base | Representation |
---|---|
bin | 1000011001000001… |
… | …1011001001101001 |
3 | 12210222101102220002 |
4 | 2012100123021221 |
5 | 14103111434312 |
6 | 1011301512345 |
7 | 106550346533 |
oct | 20620331151 |
9 | 5728342802 |
10 | 2252452457 |
11 | a564a5962 |
12 | 52a4126b5 |
13 | 29b868108 |
14 | 175212853 |
15 | d2b2d4c2 |
hex | 8641b269 |
2252452457 has 2 divisors, whose sum is σ = 2252452458. Its totient is φ = 2252452456.
The previous prime is 2252452453. The next prime is 2252452541. The reversal of 2252452457 is 7542542522.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2066975296 + 185477161 = 45464^2 + 13619^2 .
It is a cyclic number.
It is not a de Polignac number, because 2252452457 - 22 = 2252452453 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2252452457.
It is not a weakly prime, because it can be changed into another prime (2252452453) 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 as a sum of consecutive naturals, namely, 1126226228 + 1126226229.
It is an arithmetic number, because the mean of its divisors is an integer number (1126226229).
Almost surely, 22252452457 is an apocalyptic number.
It is an amenable number.
2252452457 is a deficient number, since it is larger than the sum of its proper divisors (1).
2252452457 is an equidigital number, since it uses as much as digits as its factorization.
2252452457 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 224000, while the sum is 38.
The square root of 2252452457 is about 47460.0090286549. The cubic root of 2252452457 is about 1310.8466172374.
Adding to 2252452457 its reverse (7542542522), we get a palindrome (9794994979).
The spelling of 2252452457 in words is "two billion, two hundred fifty-two million, four hundred fifty-two thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •