Base | Representation |
---|---|
bin | 110010100001011101101111… |
… | …010110000110001011100110 |
3 | 1002010202022012111200122001002 |
4 | 302201131233112012023212 |
5 | 213111024144241401042 |
6 | 2104330105021433302 |
7 | 64542364505135465 |
oct | 6241355726061346 |
9 | 1063668174618032 |
10 | 222202001122022 |
11 | 64889380925a19 |
12 | 20b082a070b832 |
13 | 96ca7358a40cc |
14 | 3cc28c44c09dc |
15 | 1aa4eb5dac132 |
hex | ca176f5862e6 |
222202001122022 has 4 divisors (see below), whose sum is σ = 333303001683036. Its totient is φ = 111101000561010.
The previous prime is 222202001122019. The next prime is 222202001122027. The reversal of 222202001122022 is 220221100202222.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×2222020011220222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 222202001121985 and 222202001122003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (222202001122027) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55550500280504 + ... + 55550500280507.
It is an arithmetic number, because the mean of its divisors is an integer number (83325750420759).
Almost surely, 2222202001122022 is an apocalyptic number.
222202001122022 is a deficient number, since it is larger than the sum of its proper divisors (111101000561014).
222202001122022 is a wasteful number, since it uses less digits than its factorization.
222202001122022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111101000561013.
The product of its (nonzero) digits is 512, while the sum is 20.
Adding to 222202001122022 its reverse (220221100202222), we get a palindrome (442423101324244).
The spelling of 222202001122022 in words is "two hundred twenty-two trillion, two hundred two billion, one million, one hundred twenty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •