Base | Representation |
---|---|
bin | 1010101101110100… |
… | …10111111101111101 |
3 | 112211221111021210212 |
4 | 11112322113331331 |
5 | 43240244013042 |
6 | 2350513042205 |
7 | 262365426416 |
oct | 52672277575 |
9 | 15757437725 |
10 | 5753110397 |
11 | 2492531aa1 |
12 | 1146856365 |
13 | 708ba5048 |
14 | 3c810280d |
15 | 23a11a482 |
hex | 156e97f7d |
5753110397 has 2 divisors, whose sum is σ = 5753110398. Its totient is φ = 5753110396.
The previous prime is 5753110387. The next prime is 5753110463. The reversal of 5753110397 is 7930113575.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5154378436 + 598731961 = 71794^2 + 24469^2 .
It is a cyclic number.
It is not a de Polignac number, because 5753110397 - 214 = 5753094013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5753110367) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2876555198 + 2876555199.
It is an arithmetic number, because the mean of its divisors is an integer number (2876555199).
Almost surely, 25753110397 is an apocalyptic number.
It is an amenable number.
5753110397 is a deficient number, since it is larger than the sum of its proper divisors (1).
5753110397 is an equidigital number, since it uses as much as digits as its factorization.
5753110397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 99225, while the sum is 41.
The square root of 5753110397 is about 75849.2610181536. The cubic root of 5753110397 is about 1791.8469120998.
The spelling of 5753110397 in words is "five billion, seven hundred fifty-three million, one hundred ten thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •