Base | Representation |
---|---|
bin | 100111110001… |
… | …001101000000 |
3 | 201121122121202 |
4 | 213301031000 |
5 | 10132101102 |
6 | 1011240332 |
7 | 154420013 |
oct | 47611500 |
9 | 21548552 |
10 | 10425152 |
11 | 5980631 |
12 | 35a90a8 |
13 | 221023a |
14 | 155537a |
15 | dade02 |
hex | 9f1340 |
10425152 has 56 divisors (see below), whose sum is σ = 22082760. Its totient is φ = 4874240.
The previous prime is 10425137. The next prime is 10425161. The reversal of 10425152 is 25152401.
It can be written as a sum of positive squares in 4 ways, for example, as 287296 + 10137856 = 536^2 + 3184^2 .
It is a super-3 number, since 3×104251523 (a number of 22 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 76028 + ... + 76164.
It is an arithmetic number, because the mean of its divisors is an integer number (394335).
Almost surely, 210425152 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 10425152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11041380).
10425152 is an abundant number, since it is smaller than the sum of its proper divisors (11657608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10425152 is a wasteful number, since it uses less digits than its factorization.
10425152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 219 (or 209 counting only the distinct ones).
The product of its (nonzero) digits is 400, while the sum is 20.
The square root of 10425152 is about 3228.8003964321. The cubic root of 10425152 is about 218.4544010608.
Adding to 10425152 its reverse (25152401), we get a palindrome (35577553).
The spelling of 10425152 in words is "ten million, four hundred twenty-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •