Base | Representation |
---|---|
bin | 101000011100… |
… | …001000110000 |
3 | 201221120211221 |
4 | 220130020300 |
5 | 10203213013 |
6 | 1015114424 |
7 | 156051505 |
oct | 50341060 |
9 | 21846757 |
10 | 10601008 |
11 | 5a90770 |
12 | 3672a14 |
13 | 22722b2 |
14 | 159d4ac |
15 | de608d |
hex | a1c230 |
10601008 has 80 divisors (see below), whose sum is σ = 24284160. Its totient is φ = 4435200.
The previous prime is 10600969. The next prime is 10601011. The reversal of 10601008 is 80010601.
It is a super-2 number, since 2×106010082 = 224762741232128, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a junction number, because it is equal to n+sod(n) for n = 10600982 and 10601000.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 158191 + ... + 158257.
It is an arithmetic number, because the mean of its divisors is an integer number (303552).
Almost surely, 210601008 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 10601008, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12142080).
10601008 is an abundant number, since it is smaller than the sum of its proper divisors (13683152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10601008 is a wasteful number, since it uses less digits than its factorization.
10601008 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 146 (or 140 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 16.
The square root of 10601008 is about 3255.9189179094. The cubic root of 10601008 is about 219.6758863725.
Adding to 10601008 its reverse (80010601), we get a palindrome (90611609).
The spelling of 10601008 in words is "ten million, six hundred one thousand, eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •