Base | Representation |
---|---|
bin | 110010101001… |
… | …011100001001 |
3 | 220222112112102 |
4 | 302221130021 |
5 | 11344330222 |
6 | 1152323145 |
7 | 220565162 |
oct | 62513411 |
9 | 26875472 |
10 | 13276937 |
11 | 7549183 |
12 | 45434b5 |
13 | 299b29b |
14 | 1a98769 |
15 | 1273d92 |
hex | ca9709 |
13276937 has 2 divisors, whose sum is σ = 13276938. Its totient is φ = 13276936.
The previous prime is 13276933. The next prime is 13276973. The reversal of 13276937 is 73967231.
Together with next prime (13276973) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13097161 + 179776 = 3619^2 + 424^2 .
It is a cyclic number.
It is not a de Polignac number, because 13276937 - 22 = 13276933 is a prime.
It is a super-2 number, since 2×132769372 = 352554112203938, which contains 22 as substring.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13276937.
It is not a weakly prime, because it can be changed into another prime (13276933) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6638468 + 6638469.
It is an arithmetic number, because the mean of its divisors is an integer number (6638469).
Almost surely, 213276937 is an apocalyptic number.
It is an amenable number.
13276937 is a deficient number, since it is larger than the sum of its proper divisors (1).
13276937 is an equidigital number, since it uses as much as digits as its factorization.
13276937 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 47628, while the sum is 38.
The square root of 13276937 is about 3643.7531475115. The cubic root of 13276937 is about 236.7914215852.
The spelling of 13276937 in words is "thirteen million, two hundred seventy-six thousand, nine hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •