Base | Representation |
---|---|
bin | 101010011000… |
… | …1110101101001 |
3 | 1112211002220202 |
4 | 1110301311221 |
5 | 21142133413 |
6 | 2112201545 |
7 | 356621453 |
oct | 124616551 |
9 | 45732822 |
10 | 22224233 |
11 | 115aa439 |
12 | 75392b5 |
13 | 47b1945 |
14 | 2d472d3 |
15 | 1e3ee58 |
hex | 1531d69 |
22224233 has 4 divisors (see below), whose sum is σ = 23190528. Its totient is φ = 21257940.
The previous prime is 22224229. The next prime is 22224247. The reversal of 22224233 is 33242222.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 22224233 - 22 = 22224229 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22224203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 483113 + ... + 483158.
It is an arithmetic number, because the mean of its divisors is an integer number (5797632).
Almost surely, 222224233 is an apocalyptic number.
22224233 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
22224233 is a deficient number, since it is larger than the sum of its proper divisors (966295).
22224233 is an equidigital number, since it uses as much as digits as its factorization.
22224233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 966294.
The product of its digits is 1152, while the sum is 20.
The square root of 22224233 is about 4714.2584782763. The cubic root of 22224233 is about 281.1527012898.
Adding to 22224233 its reverse (33242222), we get a palindrome (55466455).
The spelling of 22224233 in words is "twenty-two million, two hundred twenty-four thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •