Base | Representation |
---|---|
bin | 100000001100000110000… |
… | …100100101010010000101 |
3 | 21211110120210002212102220 |
4 | 200030012010211102011 |
5 | 242220144031201041 |
6 | 4412103335322553 |
7 | 315545445646362 |
oct | 40140604452205 |
9 | 7743523085386 |
10 | 2212010022021 |
11 | 783120a99318 |
12 | 2b8851820459 |
13 | 13078cb16947 |
14 | 790c1a3b469 |
15 | 3c815a01d66 |
hex | 20306125485 |
2212010022021 has 4 divisors (see below), whose sum is σ = 2949346696032. Its totient is φ = 1474673348012.
The previous prime is 2212010022011. The next prime is 2212010022059. The reversal of 2212010022021 is 1202200102122.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2212010022021 - 217 = 2212009890949 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2212010022011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 368668337001 + ... + 368668337006.
It is an arithmetic number, because the mean of its divisors is an integer number (737336674008).
Almost surely, 22212010022021 is an apocalyptic number.
It is an amenable number.
2212010022021 is a deficient number, since it is larger than the sum of its proper divisors (737336674011).
2212010022021 is an equidigital number, since it uses as much as digits as its factorization.
2212010022021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 737336674010.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 2212010022021 its reverse (1202200102122), we get a palindrome (3414210124143).
The spelling of 2212010022021 in words is "two trillion, two hundred twelve billion, ten million, twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •