Base | Representation |
---|---|
bin | 100111000100100… |
… | …1001011110000001 |
3 | 10101100220202121201 |
4 | 1032021021132001 |
5 | 10141110132204 |
6 | 334031421201 |
7 | 44326331311 |
oct | 11611113601 |
9 | 3340822551 |
10 | 1311020929 |
11 | 613045479 |
12 | 307084801 |
13 | 17b7c643a |
14 | c618d441 |
15 | 7a16a9a4 |
hex | 4e249781 |
1311020929 has 2 divisors, whose sum is σ = 1311020930. Its totient is φ = 1311020928.
The previous prime is 1311020897. The next prime is 1311020947. The reversal of 1311020929 is 9290201131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1085570704 + 225450225 = 32948^2 + 15015^2 .
It is a cyclic number.
It is not a de Polignac number, because 1311020929 - 25 = 1311020897 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1311020897 and 1311020906.
It is not a weakly prime, because it can be changed into another prime (1311020329) 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, 655510464 + 655510465.
It is an arithmetic number, because the mean of its divisors is an integer number (655510465).
Almost surely, 21311020929 is an apocalyptic number.
It is an amenable number.
1311020929 is a deficient number, since it is larger than the sum of its proper divisors (1).
1311020929 is an equidigital number, since it uses as much as digits as its factorization.
1311020929 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 28.
The square root of 1311020929 is about 36208.0229921491. The cubic root of 1311020929 is about 1094.4683529394.
The spelling of 1311020929 in words is "one billion, three hundred eleven million, twenty thousand, nine hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •