Base | Representation |
---|---|
bin | 10011000100111111100… |
… | …010011010111010011101 |
3 | 11122100000000010222022222 |
4 | 103010333202122322131 |
5 | 132434442414404041 |
6 | 2442140200315125 |
7 | 163501366512242 |
oct | 23047742327235 |
9 | 4570000128288 |
10 | 1311031013021 |
11 | 466006912584 |
12 | 192105772aa5 |
13 | 9682558cb92 |
14 | 4765060d5c9 |
15 | 2418258d74b |
hex | 1313f89ae9d |
1311031013021 has 2 divisors, whose sum is σ = 1311031013022. Its totient is φ = 1311031013020.
The previous prime is 1311031013009. The next prime is 1311031013023. The reversal of 1311031013021 is 1203101301131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 753337202500 + 557693810521 = 867950^2 + 746789^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1311031013021 is a prime.
Together with 1311031013023, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1311031013023) 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, 655515506510 + 655515506511.
It is an arithmetic number, because the mean of its divisors is an integer number (655515506511).
Almost surely, 21311031013021 is an apocalyptic number.
It is an amenable number.
1311031013021 is a deficient number, since it is larger than the sum of its proper divisors (1).
1311031013021 is an equidigital number, since it uses as much as digits as its factorization.
1311031013021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 1311031013021 its reverse (1203101301131), we get a palindrome (2514132314152).
The spelling of 1311031013021 in words is "one trillion, three hundred eleven billion, thirty-one million, thirteen thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •