Base | Representation |
---|---|
bin | 101000000100… |
… | …111111011001 |
3 | 201202202210120 |
4 | 220010333121 |
5 | 10142144301 |
6 | 1013103453 |
7 | 155205216 |
oct | 50047731 |
9 | 21682716 |
10 | 10506201 |
11 | 5a26512 |
12 | 3627b89 |
13 | 223b0b4 |
14 | 1576b0d |
15 | dc7e36 |
hex | a04fd9 |
10506201 has 8 divisors (see below), whose sum is σ = 14067840. Its totient is φ = 6974352.
The previous prime is 10506191. The next prime is 10506211. The reversal of 10506201 is 10260501.
10506201 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (10506191) and next prime (10506211).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10506201 - 25 = 10506169 is a prime.
It is a super-2 number, since 2×105062012 = 220760518904802, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10506211) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6610 + ... + 8043.
It is an arithmetic number, because the mean of its divisors is an integer number (1758480).
Almost surely, 210506201 is an apocalyptic number.
It is an amenable number.
10506201 is a deficient number, since it is larger than the sum of its proper divisors (3561639).
10506201 is a wasteful number, since it uses less digits than its factorization.
10506201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14895.
The product of its (nonzero) digits is 60, while the sum is 15.
The square root of 10506201 is about 3241.3270430489. The cubic root of 10506201 is about 219.0190554925.
Adding to 10506201 its reverse (10260501), we get a palindrome (20766702).
The spelling of 10506201 in words is "ten million, five hundred six thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •