Base | Representation |
---|---|
bin | 110010100000001010000110… |
… | …110110100111100010100110 |
3 | 1002010102201102012022110001102 |
4 | 302200022012312213202212 |
5 | 213103041242002210042 |
6 | 2104220534150000102 |
7 | 64533035255364044 |
oct | 6240120666474246 |
9 | 1063381365273042 |
10 | 222112201210022 |
11 | 6485428a147a12 |
12 | 20ab29ba946032 |
13 | 96c212436a1c6 |
14 | 3cbc405dc9394 |
15 | 1aa29ac3a5b32 |
hex | ca0286da78a6 |
222112201210022 has 4 divisors (see below), whose sum is σ = 333168301815036. Its totient is φ = 111056100605010.
The previous prime is 222112201209991. The next prime is 222112201210027. The reversal of 222112201210022 is 220012102211222.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×2221122012100222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 222112201209976 and 222112201210003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (222112201210027) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55528050302504 + ... + 55528050302507.
It is an arithmetic number, because the mean of its divisors is an integer number (83292075453759).
Almost surely, 2222112201210022 is an apocalyptic number.
222112201210022 is a deficient number, since it is larger than the sum of its proper divisors (111056100605014).
222112201210022 is a wasteful number, since it uses less digits than its factorization.
222112201210022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111056100605013.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 222112201210022 its reverse (220012102211222), we get a palindrome (442124303421244).
The spelling of 222112201210022 in words is "two hundred twenty-two trillion, one hundred twelve billion, two hundred one million, two hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •