Base | Representation |
---|---|
bin | 101111111101101111… |
… | …0000100000110000101 |
3 | 100211212110201020001001 |
4 | 1133323132010012011 |
5 | 3141422310210432 |
6 | 115152524133301 |
7 | 10304341561063 |
oct | 1377336040605 |
9 | 324773636031 |
10 | 103003210117 |
11 | 3a757699335 |
12 | 17b67697231 |
13 | 9936a79152 |
14 | 4db1c61033 |
15 | 2a2cc149e7 |
hex | 17fb784185 |
103003210117 has 2 divisors, whose sum is σ = 103003210118. Its totient is φ = 103003210116.
The previous prime is 103003210043. The next prime is 103003210127. The reversal of 103003210117 is 711012300301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 83582279236 + 19420930881 = 289106^2 + 139359^2 .
It is a cyclic number.
It is not a de Polignac number, because 103003210117 - 27 = 103003209989 is a prime.
It is a super-2 number, since 2×1030032101172 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103003210094 and 103003210103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103003210127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51501605058 + 51501605059.
It is an arithmetic number, because the mean of its divisors is an integer number (51501605059).
Almost surely, 2103003210117 is an apocalyptic number.
It is an amenable number.
103003210117 is a deficient number, since it is larger than the sum of its proper divisors (1).
103003210117 is an equidigital number, since it uses as much as digits as its factorization.
103003210117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 126, while the sum is 19.
Adding to 103003210117 its reverse (711012300301), we get a palindrome (814015510418).
The spelling of 103003210117 in words is "one hundred three billion, three million, two hundred ten thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •