Base | Representation |
---|---|
bin | 101110100110… |
… | …100111000101 |
3 | 211222200021002 |
4 | 232212213011 |
5 | 11111414043 |
6 | 1113503045 |
7 | 205561262 |
oct | 56464705 |
9 | 24880232 |
10 | 12216773 |
11 | 6994708 |
12 | 4111a85 |
13 | 26b987a |
14 | 18a0269 |
15 | 1114bb8 |
hex | ba69c5 |
12216773 has 4 divisors (see below), whose sum is σ = 12500928. Its totient is φ = 11932620.
The previous prime is 12216767. The next prime is 12216781. The reversal of 12216773 is 37761221.
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, and also an emirpimes, since its reverse is a distinct semiprime: 37761221 = 73 ⋅517277.
It is a cyclic number.
It is not a de Polignac number, because 12216773 - 212 = 12212677 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12216173) 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, 142013 + ... + 142098.
It is an arithmetic number, because the mean of its divisors is an integer number (3125232).
Almost surely, 212216773 is an apocalyptic number.
It is an amenable number.
12216773 is a deficient number, since it is larger than the sum of its proper divisors (284155).
12216773 is an equidigital number, since it uses as much as digits as its factorization.
12216773 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 284154.
The product of its digits is 3528, while the sum is 29.
The square root of 12216773 is about 3495.2500625849. The cubic root of 12216773 is about 230.3132027917.
Adding to 12216773 its reverse (37761221), we get a palindrome (49977994).
The spelling of 12216773 in words is "twelve million, two hundred sixteen thousand, seven hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •