Base | Representation |
---|---|
bin | 10110001101010010110011… |
… | …011001000010100110100001 |
3 | 110210211012210200021101001211 |
4 | 112031102303121002212201 |
5 | 100300213304343400321 |
6 | 543421123311430121 |
7 | 26400315450621556 |
oct | 2615226331024641 |
9 | 423735720241054 |
10 | 97670565996961 |
11 | 29136944269a51 |
12 | ab55262b25341 |
13 | 42663aaa3c739 |
14 | 1a193d002aa2d |
15 | b4598005c0e1 |
hex | 58d4b36429a1 |
97670565996961 has 2 divisors, whose sum is σ = 97670565996962. Its totient is φ = 97670565996960.
The previous prime is 97670565996959. The next prime is 97670565996977. The reversal of 97670565996961 is 16969956507679.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 68441188780561 + 29229377216400 = 8272919^2 + 5406420^2 .
It is a cyclic number.
It is not a de Polignac number, because 97670565996961 - 21 = 97670565996959 is a prime.
It is a super-2 number, since 2×976705659969612 (a number of 29 digits) contains 22 as substring.
Together with 97670565996959, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (97670565996361) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 48835282998480 + 48835282998481.
It is an arithmetic number, because the mean of its divisors is an integer number (48835282998481).
Almost surely, 297670565996961 is an apocalyptic number.
It is an amenable number.
97670565996961 is a deficient number, since it is larger than the sum of its proper divisors (1).
97670565996961 is an equidigital number, since it uses as much as digits as its factorization.
97670565996961 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10416243600, while the sum is 85.
The spelling of 97670565996961 in words is "ninety-seven trillion, six hundred seventy billion, five hundred sixty-five million, nine hundred ninety-six thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •