Base | Representation |
---|---|
bin | 10011000100011111010… |
… | …001101111111001011001 |
3 | 11122021121021201001200202 |
4 | 103010133101233321121 |
5 | 132432340340142414 |
6 | 2442010343511545 |
7 | 163452105160034 |
oct | 23043721577131 |
9 | 4567537631622 |
10 | 1310489771609 |
11 | 465859347927 |
12 | 191b944585b5 |
13 | 9676a3c81a5 |
14 | 475dc7a001b |
15 | 2414ecca9de |
hex | 1311f46fe59 |
1310489771609 has 2 divisors, whose sum is σ = 1310489771610. Its totient is φ = 1310489771608.
The previous prime is 1310489771593. The next prime is 1310489771621. The reversal of 1310489771609 is 9061779840131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 919681000000 + 390808771609 = 959000^2 + 625147^2 .
It is a cyclic number.
It is not a de Polignac number, because 1310489771609 - 24 = 1310489771593 is a prime.
It is not a weakly prime, because it can be changed into another prime (1310479771609) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 655244885804 + 655244885805.
It is an arithmetic number, because the mean of its divisors is an integer number (655244885805).
Almost surely, 21310489771609 is an apocalyptic number.
It is an amenable number.
1310489771609 is a deficient number, since it is larger than the sum of its proper divisors (1).
1310489771609 is an equidigital number, since it uses as much as digits as its factorization.
1310489771609 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2286144, while the sum is 56.
The spelling of 1310489771609 in words is "one trillion, three hundred ten billion, four hundred eighty-nine million, seven hundred seventy-one thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •