Base | Representation |
---|---|
bin | 100110001111… |
… | …110000010000 |
3 | 200212101002100 |
4 | 212033300100 |
5 | 10031313000 |
6 | 554520400 |
7 | 151135215 |
oct | 46176020 |
9 | 20771070 |
10 | 10026000 |
11 | 5728756 |
12 | 3436100 |
13 | 210065a |
14 | 148db0c |
15 | d30a00 |
hex | 98fc10 |
10026000 has 120 divisors (see below), whose sum is σ = 35080344. Its totient is φ = 2668800.
The previous prime is 10025933. The next prime is 10026011. The reversal of 10026000 is 62001.
It can be written as a sum of positive squares in 4 ways, for example, as 1937664 + 8088336 = 1392^2 + 2844^2 .
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 17722 + ... + 18278.
Almost surely, 210026000 is an apocalyptic number.
10026000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10026000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17540172).
10026000 is an abundant number, since it is smaller than the sum of its proper divisors (25054344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10026000 is a wasteful number, since it uses less digits than its factorization.
10026000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 586 (or 567 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 9.
The square root of 10026000 is about 3166.3859524701. The cubic root of 10026000 is about 215.6300250877.
Adding to 10026000 its reverse (62001), we get a palindrome (10088001).
The spelling of 10026000 in words is "ten million, twenty-six thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •