Base | Representation |
---|---|
bin | 11101000110111011110… |
… | …101011001101101111001 |
3 | 21002020011010021221110111 |
4 | 131012323311121231321 |
5 | 230233114122143001 |
6 | 4130532533344321 |
7 | 264342401034361 |
oct | 35067365315571 |
9 | 7066133257414 |
10 | 2000311131001 |
11 | 701366538147 |
12 | 2838101980a1 |
13 | 116822b5b761 |
14 | 6cb5bd1d9a1 |
15 | 37075489851 |
hex | 1d1bbd59b79 |
2000311131001 has 2 divisors, whose sum is σ = 2000311131002. Its totient is φ = 2000311131000.
The previous prime is 2000311130947. The next prime is 2000311131017. The reversal of 2000311131001 is 1001311130002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1942054067776 + 58257063225 = 1393576^2 + 241365^2 .
It is a cyclic number.
It is not a de Polignac number, because 2000311131001 - 211 = 2000311128953 is a prime.
It is not a weakly prime, because it can be changed into another prime (2000311131031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1000155565500 + 1000155565501.
It is an arithmetic number, because the mean of its divisors is an integer number (1000155565501).
Almost surely, 22000311131001 is an apocalyptic number.
It is an amenable number.
2000311131001 is a deficient number, since it is larger than the sum of its proper divisors (1).
2000311131001 is an equidigital number, since it uses as much as digits as its factorization.
2000311131001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 2000311131001 its reverse (1001311130002), we get a palindrome (3001622261003).
Subtracting from 2000311131001 its reverse (1001311130002), we obtain a palindrome (999000000999).
It can be divided in two parts, 2000311 and 131001, that added together give a palindrome (2131312).
The spelling of 2000311131001 in words is "two trillion, three hundred eleven million, one hundred thirty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •