Base | Representation |
---|---|
bin | 101101001011011110… |
… | …1100011111101101001 |
3 | 100021102122000022121111 |
4 | 1122112331203331221 |
5 | 3042200113013001 |
6 | 112323222110321 |
7 | 10003203254452 |
oct | 1322675437551 |
9 | 307378008544 |
10 | 97022001001 |
11 | 38168432402 |
12 | 1697857b3a1 |
13 | 91c285c363 |
14 | 49a5744129 |
15 | 27cca8e851 |
hex | 1696f63f69 |
97022001001 has 2 divisors, whose sum is σ = 97022001002. Its totient is φ = 97022001000.
The previous prime is 97022000963. The next prime is 97022001007. The reversal of 97022001001 is 10010022079.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 71963427600 + 25058573401 = 268260^2 + 158299^2 .
It is an emirp because it is prime and its reverse (10010022079) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 97022001001 - 29 = 97022000489 is a prime.
It is not a weakly prime, because it can be changed into another prime (97022001007) 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, 48511000500 + 48511000501.
It is an arithmetic number, because the mean of its divisors is an integer number (48511000501).
Almost surely, 297022001001 is an apocalyptic number.
It is an amenable number.
97022001001 is a deficient number, since it is larger than the sum of its proper divisors (1).
97022001001 is an equidigital number, since it uses as much as digits as its factorization.
97022001001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 252, while the sum is 22.
The spelling of 97022001001 in words is "ninety-seven billion, twenty-two million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •