Base | Representation |
---|---|
bin | 1011100011110… |
… | …01100100111000 |
3 | 20202110102200012 |
4 | 11301321210320 |
5 | 144310420333 |
6 | 13342201052 |
7 | 2255130350 |
oct | 561714470 |
9 | 222412605 |
10 | 96966968 |
11 | 4a80a79a |
12 | 28583188 |
13 | 17121107 |
14 | cc41b60 |
15 | 87a5e48 |
hex | 5c79938 |
96966968 has 64 divisors (see below), whose sum is σ = 215006400. Its totient is φ = 40135680.
The previous prime is 96966967. The next prime is 96966971. The reversal of 96966968 is 86966969.
It is a super-2 number, since 2×969669682 = 18805185766226048, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (96966967) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 360338 + ... + 360606.
It is an arithmetic number, because the mean of its divisors is an integer number (3359475).
Almost surely, 296966968 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 96966968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (107503200).
96966968 is an abundant number, since it is smaller than the sum of its proper divisors (118039432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
96966968 is a wasteful number, since it uses less digits than its factorization.
96966968 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 480 (or 476 counting only the distinct ones).
The product of its digits is 7558272, while the sum is 59.
The square root of 96966968 is about 9847.1807132803. The cubic root of 96966968 is about 459.4179279179.
Subtracting from 96966968 its reverse (86966969), we obtain a palindrome (9999999).
The spelling of 96966968 in words is "ninety-six million, nine hundred sixty-six thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •