Base | Representation |
---|---|
bin | 101000011101… |
… | …000111010010 |
3 | 201221210100011 |
4 | 220131013102 |
5 | 10203330020 |
6 | 1015145134 |
7 | 156066253 |
oct | 50350722 |
9 | 21853304 |
10 | 10605010 |
11 | 5a93779 |
12 | 36751aa |
13 | 2274070 |
14 | 15a0b2a |
15 | de735a |
hex | a1d1d2 |
10605010 has 48 divisors (see below), whose sum is σ = 21510216. Its totient is φ = 3741696.
The previous prime is 10604989. The next prime is 10605013. The reversal of 10605010 is 1050601.
It can be written as a sum of positive squares in 12 ways, for example, as 165649 + 10439361 = 407^2 + 3231^2 .
It is a super-2 number, since 2×106050102 = 224932474200200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is not an unprimeable number, because it can be changed into a prime (10605013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 109282 + ... + 109378.
Almost surely, 210605010 is an apocalyptic number.
10605010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10605010 is an abundant number, since it is smaller than the sum of its proper divisors (10905206).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10605010 is a wasteful number, since it uses less digits than its factorization.
10605010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 175 (or 146 counting only the distinct ones).
The product of its (nonzero) digits is 30, while the sum is 13.
The square root of 10605010 is about 3256.5334329621. The cubic root of 10605010 is about 219.7035262690.
Adding to 10605010 its reverse (1050601), we get a palindrome (11655611).
The spelling of 10605010 in words is "ten million, six hundred five thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •