Base | Representation |
---|---|
bin | 1100010001111… |
… | …00111011010101 |
3 | 21011211110011101 |
4 | 12020330323111 |
5 | 202332310010 |
6 | 14115510101 |
7 | 2360366500 |
oct | 610747325 |
9 | 234743141 |
10 | 103010005 |
11 | 53167a3a |
12 | 2a5b8331 |
13 | 18458887 |
14 | d976137 |
15 | 909b73a |
hex | 623ced5 |
103010005 has 24 divisors (see below), whose sum is σ = 146525112. Its totient is φ = 69293952.
The previous prime is 103010003. The next prime is 103010027. The reversal of 103010005 is 500010301.
It can be written as a sum of positive squares in 4 ways, for example, as 10504081 + 92505924 = 3241^2 + 9618^2 .
It is not a de Polignac number, because 103010005 - 21 = 103010003 is a prime.
It is a super-2 number, since 2×1030100052 = 21222122260200050, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103009973 and 103010000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103010003) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 9019 + ... + 16951.
It is an arithmetic number, because the mean of its divisors is an integer number (6105213).
Almost surely, 2103010005 is an apocalyptic number.
It is an amenable number.
103010005 is a deficient number, since it is larger than the sum of its proper divisors (43515107).
103010005 is an equidigital number, since it uses as much as digits as its factorization.
103010005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8005 (or 7998 counting only the distinct ones).
The product of its (nonzero) digits is 15, while the sum is 10.
The square root of 103010005 is about 10149.3844640944. The cubic root of 103010005 is about 468.7699919177.
Adding to 103010005 its reverse (500010301), we get a palindrome (603020306).
The spelling of 103010005 in words is "one hundred three million, ten thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •