Base | Representation |
---|---|
bin | 100110111010… |
… | …101110010000 |
3 | 201012022111212 |
4 | 212322232100 |
5 | 10102431000 |
6 | 1002355252 |
7 | 152500304 |
oct | 46725620 |
9 | 21168455 |
10 | 10202000 |
11 | 5838a06 |
12 | 34bbb28 |
13 | 21627b3 |
14 | 14d7d04 |
15 | d67c35 |
hex | 9bab90 |
10202000 has 40 divisors (see below), whose sum is σ = 24673272. Its totient is φ = 4080000.
The previous prime is 10201987. The next prime is 10202009. The reversal of 10202000 is 20201.
10202000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 3211264 + 6990736 = 1792^2 + 2644^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is a Harshad number since it is a multiple of its sum of digits (5).
It is not an unprimeable number, because it can be changed into a prime (10202009) 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, 551 + ... + 4550.
Almost surely, 210202000 is an apocalyptic number.
10202000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10202000 is an abundant number, since it is smaller than the sum of its proper divisors (14471272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10202000 is an equidigital number, since it uses as much as digits as its factorization.
10202000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5124 (or 5108 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 5.
The square root of 10202000 is about 3194.0569813327. The cubic root of 10202000 is about 216.8844621273.
Adding to 10202000 its reverse (20201), we get a palindrome (10222201).
The spelling of 10202000 in words is "ten million, two hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •