Base | Representation |
---|---|
bin | 110100001110… |
… | …111000100001 |
3 | 221202122111202 |
4 | 310032320201 |
5 | 12001124244 |
6 | 1205250545 |
7 | 224245451 |
oct | 64167041 |
9 | 27678452 |
10 | 13692449 |
11 | 7802381 |
12 | 4703a55 |
13 | 2ab5454 |
14 | 1b65d61 |
15 | 130704e |
hex | d0ee21 |
13692449 has 2 divisors, whose sum is σ = 13692450. Its totient is φ = 13692448.
The previous prime is 13692443. The next prime is 13692451. The reversal of 13692449 is 94429631.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10336225 + 3356224 = 3215^2 + 1832^2 .
It is an emirp because it is prime and its reverse (94429631) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13692449 - 28 = 13692193 is a prime.
It is a Sophie Germain prime.
Together with 13692451, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (13692443) 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, 6846224 + 6846225.
It is an arithmetic number, because the mean of its divisors is an integer number (6846225).
Almost surely, 213692449 is an apocalyptic number.
It is an amenable number.
13692449 is a deficient number, since it is larger than the sum of its proper divisors (1).
13692449 is an equidigital number, since it uses as much as digits as its factorization.
13692449 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 46656, while the sum is 38.
The square root of 13692449 is about 3700.3309311466. The cubic root of 13692449 is about 239.2362817957.
It can be divided in two parts, 13692 and 449, that added together give a palindrome (14141).
The spelling of 13692449 in words is "thirteen million, six hundred ninety-two thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •