Base | Representation |
---|---|
bin | 110000101011… |
… | …011101011001 |
3 | 220000022200201 |
4 | 300223131121 |
5 | 11231322141 |
6 | 1133302201 |
7 | 213315565 |
oct | 60533531 |
9 | 26008621 |
10 | 12760921 |
11 | 7226518 |
12 | 4334961 |
13 | 284a454 |
14 | 19a26a5 |
15 | 11c1031 |
hex | c2b759 |
12760921 has 2 divisors, whose sum is σ = 12760922. Its totient is φ = 12760920.
The previous prime is 12760907. The next prime is 12760939. The reversal of 12760921 is 12906721.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7290000 + 5470921 = 2700^2 + 2339^2 .
It is an emirp because it is prime and its reverse (12906721) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12760921 - 25 = 12760889 is a prime.
It is a super-2 number, since 2×127609212 = 325682209536482, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12760921.
It is not a weakly prime, because it can be changed into another prime (12760991) 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 as a sum of consecutive naturals, namely, 6380460 + 6380461.
It is an arithmetic number, because the mean of its divisors is an integer number (6380461).
Almost surely, 212760921 is an apocalyptic number.
It is an amenable number.
12760921 is a deficient number, since it is larger than the sum of its proper divisors (1).
12760921 is an equidigital number, since it uses as much as digits as its factorization.
12760921 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 28.
The square root of 12760921 is about 3572.2431328228. The cubic root of 12760921 is about 233.6831186924.
The spelling of 12760921 in words is "twelve million, seven hundred sixty thousand, nine hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •