Base | Representation |
---|---|
bin | 1010111011110001… |
… | …00001001100001101 |
3 | 120011002120011112111 |
4 | 11131320201030031 |
5 | 44010214030042 |
6 | 2410251504021 |
7 | 265315503241 |
oct | 53570411415 |
9 | 16132504474 |
10 | 5870064397 |
11 | 254255329a |
12 | 1179a58011 |
13 | 7271a36b2 |
14 | 3d9868421 |
15 | 24551d517 |
hex | 15de2130d |
5870064397 has 2 divisors, whose sum is σ = 5870064398. Its totient is φ = 5870064396.
The previous prime is 5870064379. The next prime is 5870064407. The reversal of 5870064397 is 7934600785.
It is a happy number.
Together with previous prime (5870064379) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5754587881 + 115476516 = 75859^2 + 10746^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5870064397 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5870064397.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5870064337) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2935032198 + 2935032199.
It is an arithmetic number, because the mean of its divisors is an integer number (2935032199).
Almost surely, 25870064397 is an apocalyptic number.
It is an amenable number.
5870064397 is a deficient number, since it is larger than the sum of its proper divisors (1).
5870064397 is an equidigital number, since it uses as much as digits as its factorization.
5870064397 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1270080, while the sum is 49.
The square root of 5870064397 is about 76616.3454949399. The cubic root of 5870064397 is about 1803.9076011175.
The spelling of 5870064397 in words is "five billion, eight hundred seventy million, sixty-four thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •