Base | Representation |
---|---|
bin | 110010100000010011010101… |
… | …100010010011110101110101 |
3 | 1002010110122222211202011121002 |
4 | 302200103111202103311311 |
5 | 213103222040433033414 |
6 | 2104225253355533045 |
7 | 64533535661160461 |
oct | 6240232542236565 |
9 | 1063418884664532 |
10 | 222122111221109 |
11 | 64858505088a20 |
12 | 20ab490575a185 |
13 | 96c304350a7a8 |
14 | 3cbcaa62054a1 |
15 | 1aa2d8c3da4de |
hex | ca04d5893d75 |
222122111221109 has 8 divisors (see below), whose sum is σ = 242548249906560. Its totient is φ = 201734842449600.
The previous prime is 222122111221079. The next prime is 222122111221117. The reversal of 222122111221109 is 901122111221222.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 222122111221109 - 232 = 222117816253813 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 (222122111221159) 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 7 ways as a sum of consecutive naturals, for example, 9717466532 + ... + 9717489389.
It is an arithmetic number, because the mean of its divisors is an integer number (30318531238320).
Almost surely, 2222122111221109 is an apocalyptic number.
It is an amenable number.
222122111221109 is a deficient number, since it is larger than the sum of its proper divisors (20426138685451).
222122111221109 is a wasteful number, since it uses less digits than its factorization.
222122111221109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19434956971.
The product of its (nonzero) digits is 1152, while the sum is 29.
The spelling of 222122111221109 in words is "two hundred twenty-two trillion, one hundred twenty-two billion, one hundred eleven million, two hundred twenty-one thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •