Base | Representation |
---|---|
bin | 101101001011011110… |
… | …1111100011010001101 |
3 | 100021102122012101222002 |
4 | 1122112331330122031 |
5 | 3042200124214013 |
6 | 112323224202045 |
7 | 10003204152416 |
oct | 1322675743215 |
9 | 307378171862 |
10 | 97022101133 |
11 | 381684a0661 |
12 | 16978609325 |
13 | 91c2895ac9 |
14 | 49a576c80d |
15 | 27ccaae358 |
hex | 1696f7c68d |
97022101133 has 2 divisors, whose sum is σ = 97022101134. Its totient is φ = 97022101132.
The previous prime is 97022101027. The next prime is 97022101147. The reversal of 97022101133 is 33110122079.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 70544953609 + 26477147524 = 265603^2 + 162718^2 .
It is an emirp because it is prime and its reverse (33110122079) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 97022101133 - 216 = 97022035597 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 97022101096 and 97022101105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (97022101933) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 48511050566 + 48511050567.
It is an arithmetic number, because the mean of its divisors is an integer number (48511050567).
Almost surely, 297022101133 is an apocalyptic number.
It is an amenable number.
97022101133 is a deficient number, since it is larger than the sum of its proper divisors (1).
97022101133 is an equidigital number, since it uses as much as digits as its factorization.
97022101133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2268, while the sum is 29.
The spelling of 97022101133 in words is "ninety-seven billion, twenty-two million, one hundred one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •