Base | Representation |
---|---|
bin | 10110010001101000111000… |
… | …001111101000000101001101 |
3 | 110211212202111100022111211201 |
4 | 112101220320033220011031 |
5 | 100320111303244022224 |
6 | 544210223300345501 |
7 | 26431015544004145 |
oct | 2621507017500515 |
9 | 424782440274751 |
10 | 97969147642189 |
11 | 2924153388031a |
12 | aba30b13a5291 |
13 | 42885b2a64265 |
14 | 1a29a36a3d925 |
15 | b4d607e4ca44 |
hex | 591a383e814d |
97969147642189 has 4 divisors (see below), whose sum is σ = 98836131249756. Its totient is φ = 97102164034624.
The previous prime is 97969147642183. The next prime is 97969147642229. The reversal of 97969147642189 is 98124674196979.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 8683335562500 + 89285812079689 = 2946750^2 + 9449117^2 .
It is a cyclic number.
It is not a de Polignac number, because 97969147642189 - 217 = 97969147511117 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 (97969147642183) 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, 433491803614 + ... + 433491803839.
It is an arithmetic number, because the mean of its divisors is an integer number (24709032812439).
Almost surely, 297969147642189 is an apocalyptic number.
It is an amenable number.
97969147642189 is a deficient number, since it is larger than the sum of its proper divisors (866983607567).
97969147642189 is a wasteful number, since it uses less digits than its factorization.
97969147642189 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 866983607566.
The product of its digits is 2962842624, while the sum is 82.
The spelling of 97969147642189 in words is "ninety-seven trillion, nine hundred sixty-nine billion, one hundred forty-seven million, six hundred forty-two thousand, one hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •