Base | Representation |
---|---|
bin | 110000000000111101… |
… | …0001001001000010101 |
3 | 100212010222222102001011 |
4 | 1200001322021020111 |
5 | 3142132433442234 |
6 | 115211343332221 |
7 | 10310123012524 |
oct | 1400172111025 |
9 | 325128872034 |
10 | 103111234069 |
11 | 3a802670328 |
12 | 17b978b1071 |
13 | 995326bc4c |
14 | 4dc23404bb |
15 | 2a37451b64 |
hex | 1801e89215 |
103111234069 has 2 divisors, whose sum is σ = 103111234070. Its totient is φ = 103111234068.
The previous prime is 103111233941. The next prime is 103111234073. The reversal of 103111234069 is 960432111301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 76915811569 + 26195422500 = 277337^2 + 161850^2 .
It is a cyclic number.
It is not a de Polignac number, because 103111234069 - 27 = 103111233941 is a prime.
It is a super-2 number, since 2×1031112340692 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 103111234069.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103111234769) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51555617034 + 51555617035.
It is an arithmetic number, because the mean of its divisors is an integer number (51555617035).
Almost surely, 2103111234069 is an apocalyptic number.
It is an amenable number.
103111234069 is a deficient number, since it is larger than the sum of its proper divisors (1).
103111234069 is an equidigital number, since it uses as much as digits as its factorization.
103111234069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 31.
The spelling of 103111234069 in words is "one hundred three billion, one hundred eleven million, two hundred thirty-four thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •