Base | Representation |
---|---|
bin | 101101011010110011… |
… | …0001101110111110101 |
3 | 100022202110010220020212 |
4 | 1122311212031313311 |
5 | 3044223202144101 |
6 | 112450222235205 |
7 | 10022014051601 |
oct | 1326546156765 |
9 | 308673126225 |
10 | 97535974901 |
11 | 38401573622 |
12 | 16aa0725b05 |
13 | 9275197a21 |
14 | 4a13ad6501 |
15 | 280cc681bb |
hex | 16b598ddf5 |
97535974901 has 4 divisors (see below), whose sum is σ = 100682296704. Its totient is φ = 94389653100.
The previous prime is 97535974871. The next prime is 97535974919. The reversal of 97535974901 is 10947953579.
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, and also an emirpimes, since its reverse is a distinct semiprime: 10947953579 = 1993 ⋅5493203.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-97535974901 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (97535974931) 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 in 3 ways as a sum of consecutive naturals, for example, 1573160855 + ... + 1573160916.
It is an arithmetic number, because the mean of its divisors is an integer number (25170574176).
Almost surely, 297535974901 is an apocalyptic number.
It is an amenable number.
97535974901 is a deficient number, since it is larger than the sum of its proper divisors (3146321803).
97535974901 is a wasteful number, since it uses less digits than its factorization.
97535974901 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3146321802.
The product of its (nonzero) digits is 10716300, while the sum is 59.
The spelling of 97535974901 in words is "ninety-seven billion, five hundred thirty-five million, nine hundred seventy-four thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •