Base | Representation |
---|---|
bin | 101101010000101111… |
… | …0010001010101100001 |
3 | 100021212220211122200122 |
4 | 1122201132101111201 |
5 | 3043030234110432 |
6 | 112352521530025 |
7 | 10010444215520 |
oct | 1324136212541 |
9 | 307786748618 |
10 | 97198347617 |
11 | 38248a2a208 |
12 | 16a07643915 |
13 | 9220254377 |
14 | 49c0d2a4b7 |
15 | 27dd2c5612 |
hex | 16a1791561 |
97198347617 has 8 divisors (see below), whose sum is σ = 111087005376. Its totient is φ = 83310484752.
The previous prime is 97198347613. The next prime is 97198347629. The reversal of 97198347617 is 71674389179.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 97198347617 - 22 = 97198347613 is a prime.
It is a super-3 number, since 3×971983476173 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 97198347617.
It is not an unprimeable number, because it can be changed into a prime (97198347613) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 91583 + ... + 450315.
It is an arithmetic number, because the mean of its divisors is an integer number (13885875672).
Almost surely, 297198347617 is an apocalyptic number.
It is an amenable number.
97198347617 is a deficient number, since it is larger than the sum of its proper divisors (13888657759).
97198347617 is a wasteful number, since it uses less digits than its factorization.
97198347617 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 397447.
The product of its digits is 16003008, while the sum is 62.
The spelling of 97198347617 in words is "ninety-seven billion, one hundred ninety-eight million, three hundred forty-seven thousand, six hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.873 sec. • engine limits •