Base | Representation |
---|---|
bin | 11101010000001010100… |
… | …000111110011110111111 |
3 | 21010011201202200002200022 |
4 | 131100022200332132333 |
5 | 230413413101024411 |
6 | 4135252142522355 |
7 | 265143103342124 |
oct | 35201240763677 |
9 | 7104652602608 |
10 | 2010221111231 |
11 | 705591457a53 |
12 | 285716b963bb |
13 | 117741cbac98 |
14 | 6d41c12c74b |
15 | 374554b4edb |
hex | 1d40a83e7bf |
2010221111231 has 2 divisors, whose sum is σ = 2010221111232. Its totient is φ = 2010221111230.
The previous prime is 2010221111201. The next prime is 2010221111233. The reversal of 2010221111231 is 1321111220102.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2010221111231 - 26 = 2010221111167 is a prime.
It is a super-2 number, since 2×20102211112312 (a number of 25 digits) contains 22 as substring.
Together with 2010221111233, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2010221111233) 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, 1005110555615 + 1005110555616.
It is an arithmetic number, because the mean of its divisors is an integer number (1005110555616).
Almost surely, 22010221111231 is an apocalyptic number.
2010221111231 is a deficient number, since it is larger than the sum of its proper divisors (1).
2010221111231 is an equidigital number, since it uses as much as digits as its factorization.
2010221111231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 2010221111231 its reverse (1321111220102), we get a palindrome (3331332331333).
The spelling of 2010221111231 in words is "two trillion, ten billion, two hundred twenty-one million, one hundred eleven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •