Base | Representation |
---|---|
bin | 1000001111001001… |
… | …11110110011001111 |
3 | 102102011222001211211 |
4 | 10013210332303033 |
5 | 33024024232343 |
6 | 2010444555251 |
7 | 214404151210 |
oct | 40744766317 |
9 | 12364861754 |
10 | 4422102223 |
11 | 196a185940 |
12 | a34b52b27 |
13 | 556201246 |
14 | 2dd42d407 |
15 | 1ad35279d |
hex | 10793eccf |
4422102223 has 16 divisors (see below), whose sum is σ = 5617299456. Its totient is φ = 3380775840.
The previous prime is 4422102221. The next prime is 4422102227. The reversal of 4422102223 is 3222012244.
It is a cyclic number.
It is not a de Polignac number, because 4422102223 - 21 = 4422102221 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4422102194 and 4422102203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4422102221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 537711 + ... + 545872.
It is an arithmetic number, because the mean of its divisors is an integer number (351081216).
Almost surely, 24422102223 is an apocalyptic number.
4422102223 is a deficient number, since it is larger than the sum of its proper divisors (1195197233).
4422102223 is a wasteful number, since it uses less digits than its factorization.
4422102223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1083654.
The product of its (nonzero) digits is 1536, while the sum is 22.
The square root of 4422102223 is about 66498.8888854543. Note that the first 5 decimals coincide. The cubic root of 4422102223 is about 1641.3817206195.
Adding to 4422102223 its reverse (3222012244), we get a palindrome (7644114467).
The spelling of 4422102223 in words is "four billion, four hundred twenty-two million, one hundred two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •