Base | Representation |
---|---|
bin | 1100010110101… |
… | …11001111111001 |
3 | 21020000120020111 |
4 | 12023113033321 |
5 | 203013021410 |
6 | 14141224321 |
7 | 2365641400 |
oct | 613271771 |
9 | 236016214 |
10 | 103642105 |
11 | 53559936 |
12 | 2a8620a1 |
13 | 1861a4b8 |
14 | da9c637 |
15 | 9173b8a |
hex | 62d73f9 |
103642105 has 24 divisors (see below), whose sum is σ = 146040840. Its totient is φ = 70398720.
The previous prime is 103642103. The next prime is 103642109. The reversal of 103642105 is 501246301.
It can be written as a sum of positive squares in 4 ways, for example, as 22857961 + 80784144 = 4781^2 + 8988^2 .
It is not a de Polignac number, because 103642105 - 21 = 103642103 is a prime.
It is a super-3 number, since 3×1036421053 (a number of 25 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103642103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 24765 + ... + 28645.
It is an arithmetic number, because the mean of its divisors is an integer number (6085035).
Almost surely, 2103642105 is an apocalyptic number.
It is an amenable number.
103642105 is a deficient number, since it is larger than the sum of its proper divisors (42398735).
103642105 is a wasteful number, since it uses less digits than its factorization.
103642105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4009 (or 4002 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 22.
The square root of 103642105 is about 10180.4766587817. The cubic root of 103642105 is about 469.7268746612.
Adding to 103642105 its reverse (501246301), we get a palindrome (604888406).
The spelling of 103642105 in words is "one hundred three million, six hundred forty-two thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •