Base | Representation |
---|---|
bin | 10110001100111111111001… |
… | …000100000110001101101000 |
3 | 110210202021101112002200021201 |
4 | 112030333321010012031220 |
5 | 100244400213034402433 |
6 | 543403524333213544 |
7 | 26365666322263150 |
oct | 2614777104061550 |
9 | 423667345080251 |
10 | 97650260075368 |
11 | 29129274091570 |
12 | ab513366312b4 |
13 | 42644c2b72910 |
14 | 1a1842526d760 |
15 | b45192512a7d |
hex | 58cff9106368 |
97650260075368 has 512 divisors, whose sum is σ = 256824284774400. Its totient is φ = 33578576179200.
The previous prime is 97650260075341. The next prime is 97650260075371. The reversal of 97650260075368 is 86357006205679.
It is an unprimeable number.
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 127 ways as a sum of consecutive naturals, for example, 6976506546 + ... + 6976520542.
It is an arithmetic number, because the mean of its divisors is an integer number (501609931200).
Almost surely, 297650260075368 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 97650260075368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (128412142387200).
97650260075368 is an abundant number, since it is smaller than the sum of its proper divisors (159174024699032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
97650260075368 is a wasteful number, since it uses less digits than its factorization.
97650260075368 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14401 (or 14397 counting only the distinct ones).
The product of its (nonzero) digits is 114307200, while the sum is 64.
The spelling of 97650260075368 in words is "ninety-seven trillion, six hundred fifty billion, two hundred sixty million, seventy-five thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •