Base | Representation |
---|---|
bin | 101110101110… |
… | …011111110101 |
3 | 212001022120112 |
4 | 232232133311 |
5 | 11113432302 |
6 | 1114312405 |
7 | 206054411 |
oct | 56563765 |
9 | 25038515 |
10 | 12249077 |
11 | 6a06a05 |
12 | 4128705 |
13 | 26cb499 |
14 | 18abd41 |
15 | 111e552 |
hex | bae7f5 |
12249077 has 2 divisors, whose sum is σ = 12249078. Its totient is φ = 12249076.
The previous prime is 12249067. The next prime is 12249079. The reversal of 12249077 is 77094221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11566801 + 682276 = 3401^2 + 826^2 .
It is an emirp because it is prime and its reverse (77094221) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12249077 is a prime.
Together with 12249079, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12249079) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6124538 + 6124539.
It is an arithmetic number, because the mean of its divisors is an integer number (6124539).
Almost surely, 212249077 is an apocalyptic number.
It is an amenable number.
12249077 is a deficient number, since it is larger than the sum of its proper divisors (1).
12249077 is an equidigital number, since it uses as much as digits as its factorization.
12249077 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7056, while the sum is 32.
The square root of 12249077 is about 3499.8681403733. The cubic root of 12249077 is about 230.5160247532.
It can be divided in two parts, 1224 and 9077, that added together give a palindrome (10301).
The spelling of 12249077 in words is "twelve million, two hundred forty-nine thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.147 sec. • engine limits •