Base | Representation |
---|---|
bin | 1010100111110010… |
… | …10001100000000001 |
3 | 112201102020111211112 |
4 | 11103321101200001 |
5 | 43134314140423 |
6 | 2341504053105 |
7 | 261212236415 |
oct | 52371214001 |
9 | 15642214745 |
10 | 5702490113 |
11 | 24669a8251 |
12 | 1131904195 |
13 | 6cb560508 |
14 | 3c14c6d45 |
15 | 23596ba78 |
hex | 153e51801 |
5702490113 has 2 divisors, whose sum is σ = 5702490114. Its totient is φ = 5702490112.
The previous prime is 5702490103. The next prime is 5702490127. The reversal of 5702490113 is 3110942075.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5205333904 + 497156209 = 72148^2 + 22297^2 .
It is a cyclic number.
It is not a de Polignac number, because 5702490113 - 216 = 5702424577 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 5702490113.
It is not a weakly prime, because it can be changed into another prime (5702490103) 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, 2851245056 + 2851245057.
It is an arithmetic number, because the mean of its divisors is an integer number (2851245057).
Almost surely, 25702490113 is an apocalyptic number.
It is an amenable number.
5702490113 is a deficient number, since it is larger than the sum of its proper divisors (1).
5702490113 is an equidigital number, since it uses as much as digits as its factorization.
5702490113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7560, while the sum is 32.
The square root of 5702490113 is about 75514.8337282153. The cubic root of 5702490113 is about 1786.5760743210.
The spelling of 5702490113 in words is "five billion, seven hundred two million, four hundred ninety thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •