Base | Representation |
---|---|
bin | 101110101000… |
… | …011110110001 |
3 | 212000001202210 |
4 | 232220132301 |
5 | 11112140213 |
6 | 1114002333 |
7 | 205622514 |
oct | 56503661 |
9 | 25001683 |
10 | 12224433 |
11 | 699a441 |
12 | 41163a9 |
13 | 26c01c0 |
14 | 18a2d7b |
15 | 11170c3 |
hex | ba87b1 |
12224433 has 16 divisors (see below), whose sum is σ = 17627456. Its totient is φ = 7490880.
The previous prime is 12224413. The next prime is 12224473. The reversal of 12224433 is 33442221.
It is not a de Polignac number, because 12224433 - 29 = 12223921 is a prime.
It is a Smith number, since the sum of its digits (21) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12224413) 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 15 ways as a sum of consecutive naturals, for example, 11463 + ... + 12483.
It is an arithmetic number, because the mean of its divisors is an integer number (1101716).
Almost surely, 212224433 is an apocalyptic number.
12224433 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
12224433 is a deficient number, since it is larger than the sum of its proper divisors (5403023).
12224433 is a wasteful number, since it uses less digits than its factorization.
12224433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1344.
The product of its digits is 1152, while the sum is 21.
The square root of 12224433 is about 3496.3456636894. The cubic root of 12224433 is about 230.3613287177.
Adding to 12224433 its reverse (33442221), we get a palindrome (45666654).
The spelling of 12224433 in words is "twelve million, two hundred twenty-four thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •