Base | Representation |
---|---|
bin | 101101001100101110… |
… | …0111101000000110000 |
3 | 100021112112122010210100 |
4 | 1122121130331000300 |
5 | 3042241312100441 |
6 | 112331313432400 |
7 | 10004221361310 |
oct | 1323134750060 |
9 | 307475563710 |
10 | 97063784496 |
11 | 38189a80a18 |
12 | 1698a56b700 |
13 | 91cb3cb913 |
14 | 49ab0dd440 |
15 | 27d1594cb6 |
hex | 169973d030 |
97063784496 has 120 divisors (see below), whose sum is σ = 311922051584. Its totient is φ = 27601015680.
The previous prime is 97063784471. The next prime is 97063784497. The reversal of 97063784496 is 69448736079.
97063784496 is a `hidden beast` number, since 9 + 7 + 0 + 63 + 7 + 84 + 496 = 666.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is not an unprimeable number, because it can be changed into a prime (97063784497) 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 23 ways as a sum of consecutive naturals, for example, 15496 + ... + 440871.
Almost surely, 297063784496 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 97063784496, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (155961025792).
97063784496 is an abundant number, since it is smaller than the sum of its proper divisors (214858267088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
97063784496 is a wasteful number, since it uses less digits than its factorization.
97063784496 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 456599 (or 456590 counting only the distinct ones).
The product of its (nonzero) digits is 54867456, while the sum is 63.
The spelling of 97063784496 in words is "ninety-seven billion, sixty-three million, seven hundred eighty-four thousand, four hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •