Base | Representation |
---|---|
bin | 100000001010011010110… |
… | …010100000011001110011 |
3 | 21211021221100021102212101 |
4 | 200022122302200121303 |
5 | 242203002242340311 |
6 | 4411205001241231 |
7 | 315453032024452 |
oct | 40123262403163 |
9 | 7737840242771 |
10 | 2210210121331 |
11 | 782387aa2293 |
12 | 2b842aa93217 |
13 | 130563c5cb54 |
14 | 78d9098cb99 |
15 | 3c75c9b7ec1 |
hex | 2029aca0673 |
2210210121331 has 2 divisors, whose sum is σ = 2210210121332. Its totient is φ = 2210210121330.
The previous prime is 2210210121319. The next prime is 2210210121341. The reversal of 2210210121331 is 1331210120122.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2210210121331 - 221 = 2210208024179 is a prime.
It is a super-2 number, since 2×22102101213312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2210210121299 and 2210210121308.
It is not a weakly prime, because it can be changed into another prime (2210210121311) 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, 1105105060665 + 1105105060666.
It is an arithmetic number, because the mean of its divisors is an integer number (1105105060666).
Almost surely, 22210210121331 is an apocalyptic number.
2210210121331 is a deficient number, since it is larger than the sum of its proper divisors (1).
2210210121331 is an equidigital number, since it uses as much as digits as its factorization.
2210210121331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 2210210121331 its reverse (1331210120122), we get a palindrome (3541420241453).
The spelling of 2210210121331 in words is "two trillion, two hundred ten billion, two hundred ten million, one hundred twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •