Base | Representation |
---|---|
bin | 101101001111011101… |
… | …1001111011001101001 |
3 | 100021202221102100222222 |
4 | 1122132323033121221 |
5 | 3042433314011332 |
6 | 112344353523425 |
7 | 10006415026631 |
oct | 1323673173151 |
9 | 307687370888 |
10 | 97155610217 |
11 | 38226899a46 |
12 | 169b5273575 |
13 | 921443c873 |
14 | 49b93a36c1 |
15 | 27d9682712 |
hex | 169eecf669 |
97155610217 has 2 divisors, whose sum is σ = 97155610218. Its totient is φ = 97155610216.
The previous prime is 97155610177. The next prime is 97155610261. The reversal of 97155610217 is 71201655179.
It is an a-pointer prime, because the next prime (97155610261) can be obtained adding 97155610217 to its sum of digits (44).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 92795781376 + 4359828841 = 304624^2 + 66029^2 .
It is an emirp because it is prime and its reverse (71201655179) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 97155610217 - 220 = 97154561641 is a prime.
It is not a weakly prime, because it can be changed into another prime (97155610417) 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, 48577805108 + 48577805109.
It is an arithmetic number, because the mean of its divisors is an integer number (48577805109).
Almost surely, 297155610217 is an apocalyptic number.
It is an amenable number.
97155610217 is a deficient number, since it is larger than the sum of its proper divisors (1).
97155610217 is an equidigital number, since it uses as much as digits as its factorization.
97155610217 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 132300, while the sum is 44.
The spelling of 97155610217 in words is "ninety-seven billion, one hundred fifty-five million, six hundred ten thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •