Base | Representation |
---|---|
bin | 100000011110111010001… |
… | …001010001110110011011 |
3 | 21220101201121211221202002 |
4 | 200132322021101312123 |
5 | 243033032010134321 |
6 | 4425244045031215 |
7 | 320162161421633 |
oct | 40367211216633 |
9 | 7811647757662 |
10 | 2232211021211 |
11 | 790747a22a76 |
12 | 30074ab5550b |
13 | 13265c0385c2 |
14 | 7a07a8c56c3 |
15 | 3d0e922320b |
hex | 207ba251d9b |
2232211021211 has 2 divisors, whose sum is σ = 2232211021212. Its totient is φ = 2232211021210.
The previous prime is 2232211021147. The next prime is 2232211021213. The reversal of 2232211021211 is 1121201122322.
2232211021211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2232211021211 - 26 = 2232211021147 is a prime.
It is a super-3 number, since 3×22322110212113 (a number of 38 digits) contains 333 as substring.
Together with 2232211021213, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (2232211021213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1116105510605 + 1116105510606.
It is an arithmetic number, because the mean of its divisors is an integer number (1116105510606).
Almost surely, 22232211021211 is an apocalyptic number.
2232211021211 is a deficient number, since it is larger than the sum of its proper divisors (1).
2232211021211 is an equidigital number, since it uses as much as digits as its factorization.
2232211021211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 2232211021211 its reverse (1121201122322), we get a palindrome (3353412143533).
The spelling of 2232211021211 in words is "two trillion, two hundred thirty-two billion, two hundred eleven million, twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •