Base | Representation |
---|---|
bin | 101110100101… |
… | …001101011001 |
3 | 211222101101111 |
4 | 232211031121 |
5 | 11111223113 |
6 | 1113420321 |
7 | 205535452 |
oct | 56451531 |
9 | 24871344 |
10 | 12211033 |
11 | 699036a |
12 | 410a6a1 |
13 | 26b7083 |
14 | 189c129 |
15 | 111313d |
hex | ba5359 |
12211033 has 4 divisors (see below), whose sum is σ = 12239668. Its totient is φ = 12182400.
The previous prime is 12211021. The next prime is 12211057. The reversal of 12211033 is 33011221.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 33011221 = 941 ⋅35081.
It can be written as a sum of positive squares in 2 ways, for example, as 4443664 + 7767369 = 2108^2 + 2787^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12211033 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12211063) 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, 13668 + ... + 14533.
It is an arithmetic number, because the mean of its divisors is an integer number (3059917).
Almost surely, 212211033 is an apocalyptic number.
It is an amenable number.
12211033 is a deficient number, since it is larger than the sum of its proper divisors (28635).
12211033 is an equidigital number, since it uses as much as digits as its factorization.
12211033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28634.
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 12211033 is about 3494.4288517582. The cubic root of 12211033 is about 230.2771265741.
Adding to 12211033 its reverse (33011221), we get a palindrome (45222254).
The spelling of 12211033 in words is "twelve million, two hundred eleven thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •