Base | Representation |
---|---|
bin | 10011000110001011010… |
… | …110101011011011000011 |
3 | 11122110021122121210000012 |
4 | 103012023112223123003 |
5 | 133000044032101311 |
6 | 2442510315415135 |
7 | 163545043323635 |
oct | 23061326533303 |
9 | 4573248553005 |
10 | 1312303003331 |
11 | 4665a9919741 |
12 | 1923bb7544ab |
13 | 96998c6ba78 |
14 | 4773151ca55 |
15 | 2420909978b |
hex | 1318b5ab6c3 |
1312303003331 has 2 divisors, whose sum is σ = 1312303003332. Its totient is φ = 1312303003330.
The previous prime is 1312303003327. The next prime is 1312303003409. The reversal of 1312303003331 is 1333003032131.
It is a weak prime.
It is an emirp because it is prime and its reverse (1333003032131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1312303003331 - 22 = 1312303003327 is a prime.
It is a super-2 number, since 2×13123030033312 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 1312303003297 and 1312303003306.
It is not a weakly prime, because it can be changed into another prime (1312303009331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 656151501665 + 656151501666.
It is an arithmetic number, because the mean of its divisors is an integer number (656151501666).
Almost surely, 21312303003331 is an apocalyptic number.
1312303003331 is a deficient number, since it is larger than the sum of its proper divisors (1).
1312303003331 is an equidigital number, since it uses as much as digits as its factorization.
1312303003331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1458, while the sum is 23.
Adding to 1312303003331 its reverse (1333003032131), we get a palindrome (2645306035462).
The spelling of 1312303003331 in words is "one trillion, three hundred twelve billion, three hundred three million, three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •