Base | Representation |
---|---|
bin | 110010100000001010000000… |
… | …110100111111010111010111 |
3 | 1002010102201011011002112122101 |
4 | 302200022000310333113113 |
5 | 213103041040112320043 |
6 | 2104220520135142531 |
7 | 64533032620212031 |
oct | 6240120064772727 |
9 | 1063381134075571 |
10 | 222112100120023 |
11 | 64854238081563 |
12 | 20ab2990b14a47 |
13 | 96c2109434539 |
14 | 3cbc3d67d2c51 |
15 | 1aa29a358824d |
hex | ca0280d3f5d7 |
222112100120023 has 16 divisors (see below), whose sum is σ = 236944775612160. Its totient is φ = 207479585654656.
The previous prime is 222112100120003. The next prime is 222112100120069. The reversal of 222112100120023 is 320021001211222.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-222112100120023 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 (222112100120003) 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 15 ways as a sum of consecutive naturals, for example, 57488761 + ... + 61230562.
It is an arithmetic number, because the mean of its divisors is an integer number (14809048475760).
Almost surely, 2222112100120023 is an apocalyptic number.
222112100120023 is a deficient number, since it is larger than the sum of its proper divisors (14832675492137).
222112100120023 is a wasteful number, since it uses less digits than its factorization.
222112100120023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118720166.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 222112100120023 its reverse (320021001211222), we get a palindrome (542133101331245).
The spelling of 222112100120023 in words is "two hundred twenty-two trillion, one hundred twelve billion, one hundred million, one hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •