Base | Representation |
---|---|
bin | 100111000101100… |
… | …0011010100001001 |
3 | 10101101212010020011 |
4 | 1032023003110021 |
5 | 10141222120014 |
6 | 334050231521 |
7 | 44333510332 |
oct | 11613032411 |
9 | 3341763204 |
10 | 1311520009 |
11 | 613356438 |
12 | 3072855a1 |
13 | 17b93c657 |
14 | c627d289 |
15 | 7a2187c4 |
hex | 4e2c3509 |
1311520009 has 2 divisors, whose sum is σ = 1311520010. Its totient is φ = 1311520008.
The previous prime is 1311520003. The next prime is 1311520031. The reversal of 1311520009 is 9000251131.
It is an a-pointer prime, because the next prime (1311520031) can be obtained adding 1311520009 to its sum of digits (22).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 794958025 + 516561984 = 28195^2 + 22728^2 .
It is a cyclic number.
It is not a de Polignac number, because 1311520009 - 25 = 1311519977 is a prime.
It is not a weakly prime, because it can be changed into another prime (1311520003) 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, 655760004 + 655760005.
It is an arithmetic number, because the mean of its divisors is an integer number (655760005).
Almost surely, 21311520009 is an apocalyptic number.
It is an amenable number.
1311520009 is a deficient number, since it is larger than the sum of its proper divisors (1).
1311520009 is an equidigital number, since it uses as much as digits as its factorization.
1311520009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 270, while the sum is 22.
The square root of 1311520009 is about 36214.9141791058. The cubic root of 1311520009 is about 1094.6072162114.
It can be divided in two parts, 13115 and 20009, that added together give a square (33124 = 1822).
The spelling of 1311520009 in words is "one billion, three hundred eleven million, five hundred twenty thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •