Base | Representation |
---|---|
bin | 110011010000… |
… | …100000111101 |
3 | 221021200002021 |
4 | 303100200331 |
5 | 11414440424 |
6 | 1200000141 |
7 | 222132616 |
oct | 63204075 |
9 | 27250067 |
10 | 13436989 |
11 | 7648455 |
12 | 4600051 |
13 | 2a260a7 |
14 | 1adac0d |
15 | 12a64e4 |
hex | cd083d |
13436989 has 2 divisors, whose sum is σ = 13436990. Its totient is φ = 13436988.
The previous prime is 13436959. The next prime is 13436999. The reversal of 13436989 is 98963431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8749764 + 4687225 = 2958^2 + 2165^2 .
It is a cyclic number.
It is not a de Polignac number, because 13436989 - 27 = 13436861 is a prime.
It is a super-2 number, since 2×134369892 = 361105346772242, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13436909) 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, 6718494 + 6718495.
It is an arithmetic number, because the mean of its divisors is an integer number (6718495).
Almost surely, 213436989 is an apocalyptic number.
It is an amenable number.
13436989 is a deficient number, since it is larger than the sum of its proper divisors (1).
13436989 is an equidigital number, since it uses as much as digits as its factorization.
13436989 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 139968, while the sum is 43.
The square root of 13436989 is about 3665.6498741697. The cubic root of 13436989 is about 237.7391216763.
It can be divided in two parts, 134 and 36989, that multiplied together give a triangular number (4956526 = T3148).
The spelling of 13436989 in words is "thirteen million, four hundred thirty-six thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •