Base | Representation |
---|---|
bin | 110000000100000110… |
… | …0010010101111001101 |
3 | 100212102100100100210112 |
4 | 1200020030102233031 |
5 | 3142341430432214 |
6 | 115230031045405 |
7 | 10312543044215 |
oct | 1401014225715 |
9 | 325370310715 |
10 | 103216655309 |
11 | 3a857124919 |
12 | 18007070865 |
13 | 996c060191 |
14 | 4dd2343245 |
15 | 2a41827a3e |
hex | 1808312bcd |
103216655309 has 2 divisors, whose sum is σ = 103216655310. Its totient is φ = 103216655308.
The previous prime is 103216655293. The next prime is 103216655467. The reversal of 103216655309 is 903556612301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 74923733284 + 28292922025 = 273722^2 + 168205^2 .
It is a cyclic number.
It is not a de Polignac number, because 103216655309 - 24 = 103216655293 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103216655909) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51608327654 + 51608327655.
It is an arithmetic number, because the mean of its divisors is an integer number (51608327655).
Almost surely, 2103216655309 is an apocalyptic number.
It is an amenable number.
103216655309 is a deficient number, since it is larger than the sum of its proper divisors (1).
103216655309 is an equidigital number, since it uses as much as digits as its factorization.
103216655309 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 145800, while the sum is 41.
The spelling of 103216655309 in words is "one hundred three billion, two hundred sixteen million, six hundred fifty-five thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •