Base | Representation |
---|---|
bin | 1011011101010… |
… | …10111111110110 |
3 | 20200212102222110 |
4 | 11232222333312 |
5 | 144101331242 |
6 | 13312111450 |
7 | 2245004430 |
oct | 556527766 |
9 | 220772873 |
10 | 96120822 |
11 | 4a291aa6 |
12 | 28235586 |
13 | 16bb5c35 |
14 | caa1650 |
15 | 868a39c |
hex | 5baaff6 |
96120822 has 48 divisors (see below), whose sum is σ = 233418240. Its totient is φ = 25844352.
The previous prime is 96120809. The next prime is 96120823. The reversal of 96120822 is 22802169.
It is a self number, because there is not a number n which added to its sum of digits gives 96120822.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (96120823) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8179 + ... + 16097.
It is an arithmetic number, because the mean of its divisors is an integer number (4862880).
Almost surely, 296120822 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 96120822, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (116709120).
96120822 is an abundant number, since it is smaller than the sum of its proper divisors (137297418).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
96120822 is a wasteful number, since it uses less digits than its factorization.
96120822 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7965 (or 7948 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 30.
The square root of 96120822 is about 9804.1227042505. The cubic root of 96120822 is about 458.0777090800.
The spelling of 96120822 in words is "ninety-six million, one hundred twenty thousand, eight hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •