Base | Representation |
---|---|
bin | 100111000100100… |
… | …0101010101100001 |
3 | 10101100212220101202 |
4 | 1032021011111201 |
5 | 10141104112001 |
6 | 334031210545 |
7 | 44326231046 |
oct | 11611052541 |
9 | 3340786352 |
10 | 1311004001 |
11 | 61303378a |
12 | 307076a55 |
13 | 17b7bb818 |
14 | c61871cd |
15 | 7a16596b |
hex | 4e245561 |
1311004001 has 2 divisors, whose sum is σ = 1311004002. Its totient is φ = 1311004000.
The previous prime is 1311003997. The next prime is 1311004003. The reversal of 1311004001 is 1004001131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1310440000 + 564001 = 36200^2 + 751^2 .
It is a cyclic number.
It is not a de Polignac number, because 1311004001 - 22 = 1311003997 is a prime.
It is a Sophie Germain prime.
Together with 1311004003, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1311004003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 655502000 + 655502001.
It is an arithmetic number, because the mean of its divisors is an integer number (655502001).
Almost surely, 21311004001 is an apocalyptic number.
It is an amenable number.
1311004001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1311004001 is an equidigital number, since it uses as much as digits as its factorization.
1311004001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 11.
The square root of 1311004001 is about 36207.7892310481. The cubic root of 1311004001 is about 1094.4636423002.
Adding to 1311004001 its reverse (1004001131), we get a palindrome (2315005132).
The spelling of 1311004001 in words is "one billion, three hundred eleven million, four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •