Base | Representation |
---|---|
bin | 10110000100001000100011… |
… | …101101001100100110110011 |
3 | 110201121001000102101110110222 |
4 | 112010020203231030212303 |
5 | 100204410123033331444 |
6 | 542220021131243255 |
7 | 26303662451241365 |
oct | 2604104355144663 |
9 | 421531012343428 |
10 | 97041090136499 |
11 | 28a139935871a3 |
12 | aa732688a952b |
13 | 421bc214a48a2 |
14 | 19d6b571b8d35 |
15 | b343dc5eaeee |
hex | 584223b4c9b3 |
97041090136499 has 2 divisors, whose sum is σ = 97041090136500. Its totient is φ = 97041090136498.
The previous prime is 97041090136469. The next prime is 97041090136519. The reversal of 97041090136499 is 99463109014079.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 97041090136499 - 212 = 97041090132403 is a prime.
It is not a weakly prime, because it can be changed into another prime (97041090136469) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 48520545068249 + 48520545068250.
It is an arithmetic number, because the mean of its divisors is an integer number (48520545068250).
Almost surely, 297041090136499 is an apocalyptic number.
97041090136499 is a deficient number, since it is larger than the sum of its proper divisors (1).
97041090136499 is an equidigital number, since it uses as much as digits as its factorization.
97041090136499 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13226976, while the sum is 62.
The spelling of 97041090136499 in words is "ninety-seven trillion, forty-one billion, ninety million, one hundred thirty-six thousand, four hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •