Base | Representation |
---|---|
bin | 110000000110111010… |
… | …0101000001110100001 |
3 | 100212122221002102100212 |
4 | 1200031310220032201 |
5 | 3143040121141134 |
6 | 115243243423505 |
7 | 10315100663333 |
oct | 1401564501641 |
9 | 325587072325 |
10 | 103311115169 |
11 | 3a8a5481a19 |
12 | 18032824b95 |
13 | 99857b40a2 |
14 | 5000ad1453 |
15 | 2a49c85bce |
hex | 180dd283a1 |
103311115169 has 2 divisors, whose sum is σ = 103311115170. Its totient is φ = 103311115168.
The previous prime is 103311115153. The next prime is 103311115207. The reversal of 103311115169 is 961511113301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 82636126225 + 20674988944 = 287465^2 + 143788^2 .
It is a cyclic number.
It is not a de Polignac number, because 103311115169 - 24 = 103311115153 is a prime.
It is a super-2 number, since 2×1033111151692 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (103311115469) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51655557584 + 51655557585.
It is an arithmetic number, because the mean of its divisors is an integer number (51655557585).
Almost surely, 2103311115169 is an apocalyptic number.
It is an amenable number.
103311115169 is a deficient number, since it is larger than the sum of its proper divisors (1).
103311115169 is an equidigital number, since it uses as much as digits as its factorization.
103311115169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2430, while the sum is 32.
The spelling of 103311115169 in words is "one hundred three billion, three hundred eleven million, one hundred fifteen thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •