Base | Representation |
---|---|
bin | 10011000100011111010… |
… | …001101111011001010111 |
3 | 11122021121021200221212211 |
4 | 103010133101233121113 |
5 | 132432340340111214 |
6 | 2442010343454251 |
7 | 163452105151045 |
oct | 23043721573127 |
9 | 4567537627784 |
10 | 1310489769559 |
11 | 465859346333 |
12 | 191b94457387 |
13 | 9676a3c7289 |
14 | 475dc79d395 |
15 | 2414ecca0c4 |
hex | 1311f46f657 |
1310489769559 has 2 divisors, whose sum is σ = 1310489769560. Its totient is φ = 1310489769558.
The previous prime is 1310489769557. The next prime is 1310489769593. The reversal of 1310489769559 is 9559679840131.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1310489769559 - 21 = 1310489769557 is a prime.
It is a super-2 number, since 2×13104897695592 (a number of 25 digits) contains 22 as substring.
Together with 1310489769557, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 1310489769494 and 1310489769503.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1310489769557) 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, 655244884779 + 655244884780.
It is an arithmetic number, because the mean of its divisors is an integer number (655244884780).
Almost surely, 21310489769559 is an apocalyptic number.
1310489769559 is a deficient number, since it is larger than the sum of its proper divisors (1).
1310489769559 is an equidigital number, since it uses as much as digits as its factorization.
1310489769559 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 73483200, while the sum is 67.
The spelling of 1310489769559 in words is "one trillion, three hundred ten billion, four hundred eighty-nine million, seven hundred sixty-nine thousand, five hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •