Base | Representation |
---|---|
bin | 1011100001001… |
… | …10001000000000 |
3 | 20201211001210100 |
4 | 11300212020000 |
5 | 144214001102 |
6 | 13331002400 |
7 | 2252204661 |
oct | 560461000 |
9 | 221731710 |
10 | 96625152 |
11 | 4a5a69a8 |
12 | 28439400 |
13 | 17031660 |
14 | cb93368 |
15 | 8739a1c |
hex | 5c26200 |
96625152 has 120 divisors (see below), whose sum is σ = 300504204. Its totient is φ = 29712384.
The previous prime is 96625147. The next prime is 96625157. The reversal of 96625152 is 25152669.
It is an interprime number because it is at equal distance from previous prime (96625147) and next prime (96625157).
It can be written as a sum of positive squares in 2 ways, for example, as 94945536 + 1679616 = 9744^2 + 1296^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (96625157) 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, 59098 + ... + 60710.
Almost surely, 296625152 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 96625152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (150252102).
96625152 is an abundant number, since it is smaller than the sum of its proper divisors (203879052).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
96625152 is a wasteful number, since it uses less digits than its factorization.
96625152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1650 (or 1631 counting only the distinct ones).
The product of its digits is 32400, while the sum is 36.
The square root of 96625152 is about 9829.8093572561. The cubic root of 96625152 is about 458.8774645495.
The spelling of 96625152 in words is "ninety-six million, six hundred twenty-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •