Base | Representation |
---|---|
bin | 101101000000000001… |
… | …1101001110100110100 |
3 | 100020102211220220210111 |
4 | 1122000003221310310 |
5 | 3040403224100113 |
6 | 112221133432404 |
7 | 6660526040320 |
oct | 1320003516464 |
9 | 306384826714 |
10 | 96637721908 |
11 | 37a90524882 |
12 | 1688b93b704 |
13 | 9161063590 |
14 | 496a6b2980 |
15 | 27a8e8413d |
hex | 16800e9d34 |
96637721908 has 96 divisors (see below), whose sum is σ = 215188807680. Its totient is φ = 36939957120.
The previous prime is 96637721903. The next prime is 96637721923. The reversal of 96637721908 is 80912773669.
96637721908 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (96637721903) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7700703 + ... + 7713241.
It is an arithmetic number, because the mean of its divisors is an integer number (2241550080).
Almost surely, 296637721908 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 96637721908, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (107594403840).
96637721908 is an abundant number, since it is smaller than the sum of its proper divisors (118551085772).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
96637721908 is a wasteful number, since it uses less digits than its factorization.
96637721908 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13277 (or 13275 counting only the distinct ones).
The product of its (nonzero) digits is 6858432, while the sum is 58.
The spelling of 96637721908 in words is "ninety-six billion, six hundred thirty-seven million, seven hundred twenty-one thousand, nine hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •