Base | Representation |
---|---|
bin | 101101100011110001… |
… | …1111100110110001001 |
3 | 100100112110021101122111 |
4 | 1123013203330312021 |
5 | 3100332331331021 |
6 | 112540150222321 |
7 | 10032333633664 |
oct | 1330743746611 |
9 | 310473241574 |
10 | 97837370761 |
11 | 38546710809 |
12 | 16b656549a1 |
13 | 92c2763c80 |
14 | 4a41b506db |
15 | 28294508e1 |
hex | 16c78fcd89 |
97837370761 has 8 divisors (see below), whose sum is σ = 105366489480. Its totient is φ = 90308704512.
The previous prime is 97837370737. The next prime is 97837370773. The reversal of 97837370761 is 16707373879.
It can be written as a sum of positive squares in 4 ways, for example, as 43829934736 + 54007436025 = 209356^2 + 232395^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 97837370761 - 219 = 97836846473 is a prime.
It is a super-2 number, since 2×978373707612 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 97837370696 and 97837370705.
It is not an unprimeable number, because it can be changed into a prime (97837370791) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 434031 + ... + 619723.
It is an arithmetic number, because the mean of its divisors is an integer number (13170811185).
Almost surely, 297837370761 is an apocalyptic number.
It is an amenable number.
97837370761 is a deficient number, since it is larger than the sum of its proper divisors (7529118719).
97837370761 is a wasteful number, since it uses less digits than its factorization.
97837370761 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 226235.
The product of its (nonzero) digits is 9335088, while the sum is 58.
The spelling of 97837370761 in words is "ninety-seven billion, eight hundred thirty-seven million, three hundred seventy thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •