Base | Representation |
---|---|
bin | 1010000011100011001101… |
… | …00011000111100110100101 |
3 | 2220021220111002012202221010 |
4 | 11001301212203013212211 |
5 | 10344241302300401041 |
6 | 115010113210212433 |
7 | 4441361141564520 |
oct | 501614643074645 |
9 | 86256432182833 |
10 | 22112212122021 |
11 | 7055811307a4a |
12 | 25915b3124119 |
13 | c4523242c038 |
14 | 566345a05bb7 |
15 | 2852c926ea16 |
hex | 141c668c79a5 |
22112212122021 has 16 divisors (see below), whose sum is σ = 33778826368128. Its totient is φ = 12604039680000.
The previous prime is 22112212121977. The next prime is 22112212122059. The reversal of 22112212122021 is 12022121221122.
It is not a de Polignac number, because 22112212122021 - 29 = 22112212121509 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22112212122421) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1312912380 + ... + 1312929221.
It is an arithmetic number, because the mean of its divisors is an integer number (2111176648008).
Almost surely, 222112212122021 is an apocalyptic number.
22112212122021 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
22112212122021 is a deficient number, since it is larger than the sum of its proper divisors (11666614246107).
22112212122021 is a wasteful number, since it uses less digits than its factorization.
22112212122021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2625842012.
The product of its (nonzero) digits is 256, while the sum is 21.
Adding to 22112212122021 its reverse (12022121221122), we get a palindrome (34134333343143).
The spelling of 22112212122021 in words is "twenty-two trillion, one hundred twelve billion, two hundred twelve million, one hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •