Base | Representation |
---|---|
bin | 101111111110100010… |
… | …1011111001101011011 |
3 | 100211221100201122120021 |
4 | 1133331011133031123 |
5 | 3142001230301021 |
6 | 115155333211311 |
7 | 10305121200361 |
oct | 1377505371533 |
9 | 324840648507 |
10 | 103030322011 |
11 | 3a770a26961 |
12 | 17b74790b37 |
13 | 993c57c6a6 |
14 | 4db56bb631 |
15 | 2a302bcc41 |
hex | 17fd15f35b |
103030322011 has 2 divisors, whose sum is σ = 103030322012. Its totient is φ = 103030322010.
The previous prime is 103030321981. The next prime is 103030322027. The reversal of 103030322011 is 110223030301.
It is an a-pointer prime, because the next prime (103030322027) can be obtained adding 103030322011 to its sum of digits (16).
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103030322011 is a prime.
It is not a weakly prime, because it can be changed into another prime (103030322041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51515161005 + 51515161006.
It is an arithmetic number, because the mean of its divisors is an integer number (51515161006).
Almost surely, 2103030322011 is an apocalyptic number.
103030322011 is a deficient number, since it is larger than the sum of its proper divisors (1).
103030322011 is an equidigital number, since it uses as much as digits as its factorization.
103030322011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 103030322011 its reverse (110223030301), we get a palindrome (213253352312).
The spelling of 103030322011 in words is "one hundred three billion, thirty million, three hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •