Base | Representation |
---|---|
bin | 11110101111001001100… |
… | …010100011011111011101 |
3 | 21110220222120011200120222 |
4 | 132233021202203133131 |
5 | 234101301304033041 |
6 | 4254200323251125 |
7 | 305413352434415 |
oct | 36571142433735 |
9 | 7426876150528 |
10 | 2112210221021 |
11 | 74486867173a |
12 | 2a143ab19aa5 |
13 | 124246930c64 |
14 | 74335411645 |
15 | 39e2416074b |
hex | 1ebc98a37dd |
2112210221021 has 2 divisors, whose sum is σ = 2112210221022. Its totient is φ = 2112210221020.
The previous prime is 2112210220987. The next prime is 2112210221041. The reversal of 2112210221021 is 1201220122112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2102485500025 + 9724720996 = 1449995^2 + 98614^2 .
It is a cyclic number.
It is not a de Polignac number, because 2112210221021 - 234 = 2095030351837 is a prime.
It is a super-2 number, since 2×21122102210212 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2112210221041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1056105110510 + 1056105110511.
It is an arithmetic number, because the mean of its divisors is an integer number (1056105110511).
Almost surely, 22112210221021 is an apocalyptic number.
It is an amenable number.
2112210221021 is a deficient number, since it is larger than the sum of its proper divisors (1).
2112210221021 is an equidigital number, since it uses as much as digits as its factorization.
2112210221021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 2112210221021 its reverse (1201220122112), we get a palindrome (3313430343133).
The spelling of 2112210221021 in words is "two trillion, one hundred twelve billion, two hundred ten million, two hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •