Base | Representation |
---|---|
bin | 11001100001000010001001… |
… | …111101111011000001011101 |
3 | 112201100020120210021020101110 |
4 | 121201002021331323001131 |
5 | 104202113024334033041 |
6 | 1034401414501532233 |
7 | 32431500311053332 |
oct | 3141021175730135 |
9 | 481306523236343 |
10 | 112221220221021 |
11 | 3283683023931a |
12 | 10705283714079 |
13 | 4a805532839a2 |
14 | 1d9d770c6c989 |
15 | ce91e8ab2516 |
hex | 661089f7b05d |
112221220221021 has 32 divisors (see below), whose sum is σ = 151237458534400. Its totient is φ = 74010252925440.
The previous prime is 112221220220983. The next prime is 112221220221091. The reversal of 112221220221021 is 120122022122211.
It is a de Polignac number, because none of the positive numbers 2k-112221220221021 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112221220221091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10361108076 + ... + 10361118906.
It is an arithmetic number, because the mean of its divisors is an integer number (4726170579200).
Almost surely, 2112221220221021 is an apocalyptic number.
It is an amenable number.
112221220221021 is a deficient number, since it is larger than the sum of its proper divisors (39016238313379).
112221220221021 is a wasteful number, since it uses less digits than its factorization.
112221220221021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23329.
The product of its (nonzero) digits is 256, while the sum is 21.
Adding to 112221220221021 its reverse (120122022122211), we get a palindrome (232343242343232).
The spelling of 112221220221021 in words is "one hundred twelve trillion, two hundred twenty-one billion, two hundred twenty million, two hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •