Base | Representation |
---|---|
bin | 1100111011011011101… |
… | …1010011100101011001 |
3 | 210020022101112112200011 |
4 | 3032312323103211121 |
5 | 12114341224111441 |
6 | 250011554041521 |
7 | 22022102446411 |
oct | 3166673234531 |
9 | 706271475604 |
10 | 222112332121 |
11 | 86219691649 |
12 | 37068b792a1 |
13 | 17c39511b74 |
14 | aa70b43641 |
15 | 5b9e891581 |
hex | 33b6ed3959 |
222112332121 has 8 divisors (see below), whose sum is σ = 222464192384. Its totient is φ = 221760672480.
The previous prime is 222112332119. The next prime is 222112332181. The reversal of 222112332121 is 121233211222.
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 222112332121 - 21 = 222112332119 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 222112332092 and 222112332101.
It is not an unprimeable number, because it can be changed into a prime (222112332181) 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, 2248645 + ... + 2345341.
It is an arithmetic number, because the mean of its divisors is an integer number (27808024048).
Almost surely, 2222112332121 is an apocalyptic number.
It is an amenable number.
222112332121 is a deficient number, since it is larger than the sum of its proper divisors (351860263).
222112332121 is an equidigital number, since it uses as much as digits as its factorization.
222112332121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100311.
The product of its digits is 576, while the sum is 22.
Adding to 222112332121 its reverse (121233211222), we get a palindrome (343345543343).
The spelling of 222112332121 in words is "two hundred twenty-two billion, one hundred twelve million, three hundred thirty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •