Base | Representation |
---|---|
bin | 11101010000000011011… |
… | …111100110101010110111 |
3 | 21010011102120000020011221 |
4 | 131100003133212222313 |
5 | 230413142421423111 |
6 | 4135232334011211 |
7 | 265140143142244 |
oct | 35200337465267 |
9 | 7104376006157 |
10 | 2010103311031 |
11 | 705530a08a12 |
12 | 2856a3646b07 |
13 | 11772378441a |
14 | 6d40a6265cb |
15 | 37449e96371 |
hex | 1d4037e6ab7 |
2010103311031 has 2 divisors, whose sum is σ = 2010103311032. Its totient is φ = 2010103311030.
The previous prime is 2010103311019. The next prime is 2010103311053. The reversal of 2010103311031 is 1301133010102.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2010103311031 - 219 = 2010102786743 is a prime.
It is a super-2 number, since 2×20101033110312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2010103310996 and 2010103311014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2010103311431) 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, 1005051655515 + 1005051655516.
It is an arithmetic number, because the mean of its divisors is an integer number (1005051655516).
Almost surely, 22010103311031 is an apocalyptic number.
2010103311031 is a deficient number, since it is larger than the sum of its proper divisors (1).
2010103311031 is an equidigital number, since it uses as much as digits as its factorization.
2010103311031 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 16.
Adding to 2010103311031 its reverse (1301133010102), we get a palindrome (3311236321133).
The spelling of 2010103311031 in words is "two trillion, ten billion, one hundred three million, three hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •