Base | Representation |
---|---|
bin | 1001111101101010… |
… | …11101110001111001 |
3 | 111210210102000011102 |
4 | 10332311131301321 |
5 | 41423341422142 |
6 | 2242443141145 |
7 | 246362124452 |
oct | 47665356171 |
9 | 14723360142 |
10 | 5349170297 |
11 | 22a55158a9 |
12 | 10535147b5 |
13 | 6732b4233 |
14 | 38a5d4129 |
15 | 214929532 |
hex | 13ed5dc79 |
5349170297 has 2 divisors, whose sum is σ = 5349170298. Its totient is φ = 5349170296.
The previous prime is 5349170279. The next prime is 5349170303. The reversal of 5349170297 is 7920719435.
Together with previous prime (5349170279) 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., 2950227856 + 2398942441 = 54316^2 + 48979^2 .
It is a cyclic number.
It is not a de Polignac number, because 5349170297 - 212 = 5349166201 is a prime.
It is a super-2 number, since 2×53491702972 = 57227245732614136418, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5349170227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2674585148 + 2674585149.
It is an arithmetic number, because the mean of its divisors is an integer number (2674585149).
Almost surely, 25349170297 is an apocalyptic number.
It is an amenable number.
5349170297 is a deficient number, since it is larger than the sum of its proper divisors (1).
5349170297 is an equidigital number, since it uses as much as digits as its factorization.
5349170297 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 476280, while the sum is 47.
The square root of 5349170297 is about 73138.0222387781. The cubic root of 5349170297 is about 1748.8885783148. Note that the first 3 decimals are identical.
The spelling of 5349170297 in words is "five billion, three hundred forty-nine million, one hundred seventy thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •