Base | Representation |
---|---|
bin | 1100100001110… |
… | …11101010110011 |
3 | 21022202201211210 |
4 | 12100323222303 |
5 | 203401231003 |
6 | 14232411203 |
7 | 2414231556 |
oct | 620735263 |
9 | 238681753 |
10 | 105102003 |
11 | 54366766 |
12 | 2b246b03 |
13 | 18a0bb46 |
14 | dd5c69d |
15 | 9361503 |
hex | 643bab3 |
105102003 has 8 divisors (see below), whose sum is σ = 144968400. Its totient is φ = 67651808.
The previous prime is 105101989. The next prime is 105102017. The reversal of 105102003 is 300201501.
It is an interprime number because it is at equal distance from previous prime (105101989) and next prime (105102017).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 105102003 - 28 = 105101747 is a prime.
It is a super-2 number, since 2×1051020032 = 22092862069224018, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 105102003.
It is not an unprimeable number, because it can be changed into a prime (105102043) 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, 603948 + ... + 604121.
It is an arithmetic number, because the mean of its divisors is an integer number (18121050).
Almost surely, 2105102003 is an apocalyptic number.
105102003 is a deficient number, since it is larger than the sum of its proper divisors (39866397).
105102003 is a wasteful number, since it uses less digits than its factorization.
105102003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1208101.
The product of its (nonzero) digits is 30, while the sum is 12.
The square root of 105102003 is about 10251.9267945104. The cubic root of 105102003 is about 471.9221165063.
Adding to 105102003 its reverse (300201501), we get a palindrome (405303504).
The spelling of 105102003 in words is "one hundred five million, one hundred two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •