Base | Representation |
---|---|
bin | 10011101001111011000101 |
3 | 100200202211121 |
4 | 103221323011 |
5 | 2304334303 |
6 | 302233541 |
7 | 61536505 |
oct | 23517305 |
9 | 10622747 |
10 | 5152453 |
11 | 29aa129 |
12 | 18858b1 |
13 | 10b52b7 |
14 | 981a05 |
15 | 6bb9bd |
hex | 4e9ec5 |
5152453 has 2 divisors, whose sum is σ = 5152454. Its totient is φ = 5152452.
The previous prime is 5152447. The next prime is 5152457. The reversal of 5152453 is 3542515.
5152453 is digitally balanced in base 3, 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., 2712609 + 2439844 = 1647^2 + 1562^2 .
It is a cyclic number.
It is not a de Polignac number, because 5152453 - 25 = 5152421 is a prime.
It is equal to p358360 and since 5152453 and 358360 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5152457) 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, 2576226 + 2576227.
It is an arithmetic number, because the mean of its divisors is an integer number (2576227).
Almost surely, 25152453 is an apocalyptic number.
It is an amenable number.
5152453 is a deficient number, since it is larger than the sum of its proper divisors (1).
5152453 is an equidigital number, since it uses as much as digits as its factorization.
5152453 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3000, while the sum is 25.
The square root of 5152453 is about 2269.9015397149. The cubic root of 5152453 is about 172.7181640710.
Adding to 5152453 its reverse (3542515), we get a palindrome (8694968).
The spelling of 5152453 in words is "five million, one hundred fifty-two thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •