Base | Representation |
---|---|
bin | 110000000000101011… |
… | …0111101101011001111 |
3 | 100212010100121212220011 |
4 | 1200001112331223033 |
5 | 3142123103341421 |
6 | 115210413534051 |
7 | 10306651433410 |
oct | 1400126755317 |
9 | 325110555804 |
10 | 103102012111 |
11 | 3a7a844177a |
12 | 17b947a4327 |
13 | 9951390577 |
14 | 4dc101d807 |
15 | 2a3672e4e1 |
hex | 18015bdacf |
103102012111 has 32 divisors (see below), whose sum is σ = 120010480128. Its totient is φ = 86754084480.
The previous prime is 103102012087. The next prime is 103102012133. The reversal of 103102012111 is 111210201301.
It is a happy number.
It is not a de Polignac number, because 103102012111 - 217 = 103101881039 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 103102012091 and 103102012100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103102012711) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 75091821 + ... + 75093193.
It is an arithmetic number, because the mean of its divisors is an integer number (3750327504).
Almost surely, 2103102012111 is an apocalyptic number.
103102012111 is a deficient number, since it is larger than the sum of its proper divisors (16908468017).
103102012111 is a wasteful number, since it uses less digits than its factorization.
103102012111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2191.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 103102012111 its reverse (111210201301), we get a palindrome (214312213412).
The spelling of 103102012111 in words is "one hundred three billion, one hundred two million, twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •