Base | Representation |
---|---|
bin | 100111000101011… |
… | …0101111010010101 |
3 | 10101101202022220211 |
4 | 1032022311322111 |
5 | 10141213340414 |
6 | 334045125421 |
7 | 44333161303 |
oct | 11612657225 |
9 | 3341668824 |
10 | 1311465109 |
11 | 613319169 |
12 | 307259871 |
13 | 17b920676 |
14 | c6267273 |
15 | 7a2073c4 |
hex | 4e2b5e95 |
1311465109 has 2 divisors, whose sum is σ = 1311465110. Its totient is φ = 1311465108.
The previous prime is 1311465097. The next prime is 1311465121. The reversal of 1311465109 is 9015641131.
It is a balanced prime because it is at equal distance from previous prime (1311465097) and next prime (1311465121).
It can be written as a sum of positive squares in only one way, i.e., 1181846884 + 129618225 = 34378^2 + 11385^2 .
It is a cyclic number.
It is not a de Polignac number, because 1311465109 - 27 = 1311464981 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1311465179) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 655732554 + 655732555.
It is an arithmetic number, because the mean of its divisors is an integer number (655732555).
Almost surely, 21311465109 is an apocalyptic number.
It is an amenable number.
1311465109 is a deficient number, since it is larger than the sum of its proper divisors (1).
1311465109 is an equidigital number, since it uses as much as digits as its factorization.
1311465109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3240, while the sum is 31.
The square root of 1311465109 is about 36214.1561961617. The cubic root of 1311465109 is about 1094.5919426423.
The spelling of 1311465109 in words is "one billion, three hundred eleven million, four hundred sixty-five thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •