Base | Representation |
---|---|
bin | 10110000100000100000001… |
… | …001100111100111100001001 |
3 | 110201120120102202101110110201 |
4 | 112010010001030330330021 |
5 | 100204320132332303311 |
6 | 542213453344012201 |
7 | 26303430620240464 |
oct | 2604040114747411 |
9 | 421516382343421 |
10 | 97036216291081 |
11 | 28a11912404a81 |
12 | aa72328601061 |
13 | 421b6258163a2 |
14 | 19d6813b962db |
15 | b342047b39c1 |
hex | 58410133cf09 |
97036216291081 has 4 divisors (see below), whose sum is σ = 97036335857664. Its totient is φ = 97036096724500.
The previous prime is 97036216291057. The next prime is 97036216291109. The reversal of 97036216291081 is 18019261263079.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-97036216291081 is a prime.
It is a super-2 number, since 2×970362162910812 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (97036216291181) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 58557565 + ... + 60191866.
It is an arithmetic number, because the mean of its divisors is an integer number (24259083964416).
Almost surely, 297036216291081 is an apocalyptic number.
It is an amenable number.
97036216291081 is a deficient number, since it is larger than the sum of its proper divisors (119566583).
97036216291081 is a wasteful number, since it uses less digits than its factorization.
97036216291081 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 119566582.
The product of its (nonzero) digits is 1959552, while the sum is 55.
The spelling of 97036216291081 in words is "ninety-seven trillion, thirty-six billion, two hundred sixteen million, two hundred ninety-one thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •