Base | Representation |
---|---|
bin | 101101111101… |
… | …101011100111 |
3 | 211200011021222 |
4 | 231331223213 |
5 | 11041033002 |
6 | 1110130555 |
7 | 204262436 |
oct | 55755347 |
9 | 24604258 |
10 | 12049127 |
11 | 688a762 |
12 | 4050a5b |
13 | 265b47c |
14 | 185911d |
15 | 10d01a2 |
hex | b7dae7 |
12049127 has 4 divisors (see below), whose sum is σ = 12056616. Its totient is φ = 12041640.
The previous prime is 12049109. The next prime is 12049133. The reversal of 12049127 is 72194021.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12049127 is a prime.
It is a super-2 number, since 2×120491272 = 290362922924258, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12049096 and 12049105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12049327) 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 in 3 ways as a sum of consecutive naturals, for example, 233 + ... + 4914.
It is an arithmetic number, because the mean of its divisors is an integer number (3014154).
Almost surely, 212049127 is an apocalyptic number.
12049127 is a deficient number, since it is larger than the sum of its proper divisors (7489).
12049127 is an equidigital number, since it uses as much as digits as its factorization.
12049127 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7488.
The product of its (nonzero) digits is 1008, while the sum is 26.
The square root of 12049127 is about 3471.1852442646. The cubic root of 12049127 is about 229.2548474458.
The spelling of 12049127 in words is "twelve million, forty-nine thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •