Base | Representation |
---|---|
bin | 100110110001… |
… | …000100100000 |
3 | 201010022021120 |
4 | 212301010200 |
5 | 10100144324 |
6 | 1001452240 |
7 | 152244114 |
oct | 46610440 |
9 | 21108246 |
10 | 10162464 |
11 | 5811234 |
12 | 34a1080 |
13 | 214a7c0 |
14 | 14c7744 |
15 | d5b179 |
hex | 9b1120 |
10162464 has 96 divisors (see below), whose sum is σ = 30481920. Its totient is φ = 2936832.
The previous prime is 10162433. The next prime is 10162469. The reversal of 10162464 is 46426101.
It is a tau number, because it is divible by the number of its divisors (96).
It is a Harshad number since it is a multiple of its sum of digits (24).
It is not an unprimeable number, because it can be changed into a prime (10162469) 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, 20977 + ... + 21455.
It is an arithmetic number, because the mean of its divisors is an integer number (317520).
Almost surely, 210162464 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 10162464, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15240960).
10162464 is an abundant number, since it is smaller than the sum of its proper divisors (20319456).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10162464 is a wasteful number, since it uses less digits than its factorization.
10162464 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 522 (or 514 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
The square root of 10162464 is about 3187.8619794464. The cubic root of 10162464 is about 216.6039339752.
Adding to 10162464 its reverse (46426101), we get a palindrome (56588565).
The spelling of 10162464 in words is "ten million, one hundred sixty-two thousand, four hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •