Base | Representation |
---|---|
bin | 1100001010010… |
… | …11010000000111 |
3 | 21002222011021100 |
4 | 12011023100013 |
5 | 202104120403 |
6 | 14042351143 |
7 | 2346104463 |
oct | 605132007 |
9 | 232864240 |
10 | 102020103 |
11 | 52651239 |
12 | 2a1bb4b3 |
13 | 181a0133 |
14 | d7994a3 |
15 | 8e532a3 |
hex | 614b407 |
102020103 has 6 divisors (see below), whose sum is σ = 147362384. Its totient is φ = 68013396.
The previous prime is 102020099. The next prime is 102020119. The reversal of 102020103 is 301020201.
It is a happy number.
It is not a de Polignac number, because 102020103 - 22 = 102020099 is a prime.
It is a super-2 number, since 2×1020201032 = 20816202832261218, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 11335567 = 102020103 / (1 + 0 + 2 + 0 + 2 + 0 + 1 + 0 + 3).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102020143) 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 5 ways as a sum of consecutive naturals, for example, 5667775 + ... + 5667792.
Almost surely, 2102020103 is an apocalyptic number.
102020103 is a deficient number, since it is larger than the sum of its proper divisors (45342281).
102020103 is a wasteful number, since it uses less digits than its factorization.
102020103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11335573 (or 11335570 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 9.
The square root of 102020103 is about 10100.5001361319. The cubic root of 102020103 is about 467.2635661866.
Adding to 102020103 its reverse (301020201), we get a palindrome (403040304).
The spelling of 102020103 in words is "one hundred two million, twenty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •