Base | Representation |
---|---|
bin | 1100001010111… |
… | …11011111100011 |
3 | 21010010101000000 |
4 | 12011133133203 |
5 | 202114244021 |
6 | 14044231043 |
7 | 2346601263 |
oct | 605373743 |
9 | 233111000 |
10 | 102103011 |
11 | 526a855a |
12 | 2a23b483 |
13 | 181cbaaa |
14 | d7bb7a3 |
15 | 8e6cb26 |
hex | 615f7e3 |
102103011 has 28 divisors (see below), whose sum is σ = 154008072. Its totient is φ = 67658976.
The previous prime is 102103009. The next prime is 102103013. The reversal of 102103011 is 110301201.
It is an interprime number because it is at equal distance from previous prime (102103009) and next prime (102103013).
It is not a de Polignac number, because 102103011 - 21 = 102103009 is a prime.
It is a super-2 number, since 2×1021030112 = 20850049710532242, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 102102984 and 102103002.
It is not an unprimeable number, because it can be changed into a prime (102103013) 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 27 ways as a sum of consecutive naturals, for example, 165175 + ... + 165791.
Almost surely, 2102103011 is an apocalyptic number.
102103011 is a deficient number, since it is larger than the sum of its proper divisors (51905061).
102103011 is an frugal number, since it uses more digits than its factorization.
102103011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 862 (or 847 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
The square root of 102103011 is about 10104.6034558512. The cubic root of 102103011 is about 467.3901079079.
Adding to 102103011 its reverse (110301201), we get a palindrome (212404212).
The spelling of 102103011 in words is "one hundred two million, one hundred three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •