Base | Representation |
---|---|
bin | 1011100000001… |
… | …11010111010000 |
3 | 20201120122221200 |
4 | 11300013113100 |
5 | 144200433102 |
6 | 13324151200 |
7 | 2251141431 |
oct | 560072720 |
9 | 221518850 |
10 | 96499152 |
11 | 4a520272 |
12 | 28398500 |
13 | 16cb91b9 |
14 | cb5d488 |
15 | 871251c |
hex | 5c075d0 |
96499152 has 60 divisors (see below), whose sum is σ = 271052964. Its totient is φ = 32048640.
The previous prime is 96499129. The next prime is 96499159. The reversal of 96499152 is 25199469.
96499152 is a `hidden beast` number, since 9 + 6 + 499 + 152 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 41679936 + 54819216 = 6456^2 + 7404^2 .
It is a junction number, because it is equal to n+sod(n) for n = 96499098 and 96499107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (96499159) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 44002 + ... + 46142.
Almost surely, 296499152 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 96499152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (135526482).
96499152 is an abundant number, since it is smaller than the sum of its proper divisors (174553812).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
96499152 is a wasteful number, since it uses less digits than its factorization.
96499152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2468 (or 2459 counting only the distinct ones).
The product of its digits is 174960, while the sum is 45.
The square root of 96499152 is about 9823.3981900359. The cubic root of 96499152 is about 458.6779177803.
The spelling of 96499152 in words is "ninety-six million, four hundred ninety-nine thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •