Base | Representation |
---|---|
bin | 10100101011001110… |
… | …101111101101101111 |
3 | 2010022011110001120000 |
4 | 110223032233231233 |
5 | 330431212402343 |
6 | 14110521355343 |
7 | 1414065632256 |
oct | 245316575557 |
9 | 63264401500 |
10 | 22200122223 |
11 | 9462432454 |
12 | 4376938b53 |
13 | 212a44cac6 |
14 | 110859579d |
15 | 89deaded3 |
hex | 52b3afb6f |
22200122223 has 20 divisors (see below), whose sum is σ = 33219712680. Its totient is φ = 14774836752.
The previous prime is 22200122221. The next prime is 22200122233. The reversal of 22200122223 is 32222100222.
It is not a de Polignac number, because 22200122223 - 21 = 22200122221 is a prime.
It is a super-2 number, since 2×222001222232 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22200122196 and 22200122205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22200122221) 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 19 ways as a sum of consecutive naturals, for example, 185908 + ... + 281001.
It is an arithmetic number, because the mean of its divisors is an integer number (1660985634).
Almost surely, 222200122223 is an apocalyptic number.
22200122223 is a deficient number, since it is larger than the sum of its proper divisors (11019590457).
22200122223 is an equidigital number, since it uses as much as digits as its factorization.
22200122223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 467508 (or 467499 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 18.
Adding to 22200122223 its reverse (32222100222), we get a palindrome (54422222445).
The spelling of 22200122223 in words is "twenty-two billion, two hundred million, one hundred twenty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •