Base | Representation |
---|---|
bin | 10011000100111000000… |
… | …110110011000011000011 |
3 | 11122022200022112111012121 |
4 | 103010320012303003003 |
5 | 132434214010100311 |
6 | 2442115544105111 |
7 | 163465323651622 |
oct | 23047006630303 |
9 | 4568608474177 |
10 | 1310906331331 |
11 | 465a524a3363 |
12 | 19208ba65197 |
13 | 968057b702c |
14 | 4763bc356b9 |
15 | 24176660b71 |
hex | 131381b30c3 |
1310906331331 has 2 divisors, whose sum is σ = 1310906331332. Its totient is φ = 1310906331330.
The previous prime is 1310906331323. The next prime is 1310906331359. The reversal of 1310906331331 is 1331336090131.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1310906331331 - 23 = 1310906331323 is a prime.
It is a super-2 number, since 2×13109063313312 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1310906331391) 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, 655453165665 + 655453165666.
It is an arithmetic number, because the mean of its divisors is an integer number (655453165666).
Almost surely, 21310906331331 is an apocalyptic number.
1310906331331 is a deficient number, since it is larger than the sum of its proper divisors (1).
1310906331331 is an equidigital number, since it uses as much as digits as its factorization.
1310906331331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13122, while the sum is 34.
The spelling of 1310906331331 in words is "one trillion, three hundred ten billion, nine hundred six million, three hundred thirty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •