Base | Representation |
---|---|
bin | 11101010000001111111… |
… | …001000101001010100011 |
3 | 21010011222001101222112112 |
4 | 131100033321011022203 |
5 | 230414104144104011 |
6 | 4135305124145535 |
7 | 265145250150146 |
oct | 35201771051243 |
9 | 7104861358475 |
10 | 2010311316131 |
11 | 705628369258 |
12 | 2857412382ab |
13 | 1177578b2271 |
14 | 6d42a0d005d |
15 | 3745d38258b |
hex | 1d40fe452a3 |
2010311316131 has 2 divisors, whose sum is σ = 2010311316132. Its totient is φ = 2010311316130.
The previous prime is 2010311316037. The next prime is 2010311316163. The reversal of 2010311316131 is 1316131130102.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2010311316131 - 222 = 2010307121827 is a prime.
It is a super-2 number, since 2×20103113161312 (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 = 2010311316097 and 2010311316106.
It is not a weakly prime, because it can be changed into another prime (2010311316191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005155658065 + 1005155658066.
It is an arithmetic number, because the mean of its divisors is an integer number (1005155658066).
Almost surely, 22010311316131 is an apocalyptic number.
2010311316131 is a deficient number, since it is larger than the sum of its proper divisors (1).
2010311316131 is an equidigital number, since it uses as much as digits as its factorization.
2010311316131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 324, while the sum is 23.
Adding to 2010311316131 its reverse (1316131130102), we get a palindrome (3326442446233).
The spelling of 2010311316131 in words is "two trillion, ten billion, three hundred eleven million, three hundred sixteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •