Base | Representation |
---|---|
bin | 11101010000000011111… |
… | …001100010101000100001 |
3 | 21010011110000210122221112 |
4 | 131100003321202220201 |
5 | 230413201142011431 |
6 | 4135233135433105 |
7 | 265140255011102 |
oct | 35200371425041 |
9 | 7104400718845 |
10 | 2010110110241 |
11 | 7055348322a2 |
12 | 2856a5985795 |
13 | 117724cc511c |
14 | 6d40b4b63a9 |
15 | 3744a88ac2b |
hex | 1d403e62a21 |
2010110110241 has 2 divisors, whose sum is σ = 2010110110242. Its totient is φ = 2010110110240.
The previous prime is 2010110110187. The next prime is 2010110110277. The reversal of 2010110110241 is 1420110110102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1852497934225 + 157612176016 = 1361065^2 + 397004^2 .
It is a cyclic number.
It is not a de Polignac number, because 2010110110241 - 238 = 1735232203297 is a prime.
It is not a weakly prime, because it can be changed into another prime (2010110110441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005055055120 + 1005055055121.
It is an arithmetic number, because the mean of its divisors is an integer number (1005055055121).
Almost surely, 22010110110241 is an apocalyptic number.
It is an amenable number.
2010110110241 is a deficient number, since it is larger than the sum of its proper divisors (1).
2010110110241 is an equidigital number, since it uses as much as digits as its factorization.
2010110110241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 2010110110241 its reverse (1420110110102), we get a palindrome (3430220220343).
The spelling of 2010110110241 in words is "two trillion, ten billion, one hundred ten million, one hundred ten thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •