Base | Representation |
---|---|
bin | 110001100100… |
… | …001111001001 |
3 | 220110010201001 |
4 | 301210033021 |
5 | 11311242411 |
6 | 1142255001 |
7 | 215304604 |
oct | 61441711 |
9 | 26403631 |
10 | 12993481 |
11 | 7375216 |
12 | 4427461 |
13 | 28cc267 |
14 | 1a2333b |
15 | 1219dc1 |
hex | c643c9 |
12993481 has 2 divisors, whose sum is σ = 12993482. Its totient is φ = 12993480.
The previous prime is 12993451. The next prime is 12993493. The reversal of 12993481 is 18439921.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10791225 + 2202256 = 3285^2 + 1484^2 .
It is an emirp because it is prime and its reverse (18439921) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12993481 - 213 = 12985289 is a prime.
It is a super-2 number, since 2×129934812 = 337661096994722, 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 12993481.
It is not a weakly prime, because it can be changed into another prime (12993451) 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, 6496740 + 6496741.
It is an arithmetic number, because the mean of its divisors is an integer number (6496741).
Almost surely, 212993481 is an apocalyptic number.
It is an amenable number.
12993481 is a deficient number, since it is larger than the sum of its proper divisors (1).
12993481 is an equidigital number, since it uses as much as digits as its factorization.
12993481 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 15552, while the sum is 37.
The square root of 12993481 is about 3604.6471394576. The cubic root of 12993481 is about 235.0941587369.
The spelling of 12993481 in words is "twelve million, nine hundred ninety-three thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •