Base | Representation |
---|---|
bin | 11001000010001010… |
… | …11111011111000001 |
3 | 1021200122201012212012 |
4 | 30201011133133001 |
5 | 210011114132242 |
6 | 10101345342305 |
7 | 654025012301 |
oct | 144105373701 |
9 | 37618635765 |
10 | 13439989697 |
11 | 5777584202 |
12 | 2731037995 |
13 | 13625a5234 |
14 | 916d7d601 |
15 | 539db4282 |
hex | 32115f7c1 |
13439989697 has 2 divisors, whose sum is σ = 13439989698. Its totient is φ = 13439989696.
The previous prime is 13439989679. The next prime is 13439989729. The reversal of 13439989697 is 79698993431.
13439989697 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with previous prime (13439989679) 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., 11275041856 + 2164947841 = 106184^2 + 46529^2 .
It is a cyclic number.
It is not a de Polignac number, because 13439989697 - 220 = 13438941121 is a prime.
It is not a weakly prime, because it can be changed into another prime (13439989627) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6719994848 + 6719994849.
It is an arithmetic number, because the mean of its divisors is an integer number (6719994849).
Almost surely, 213439989697 is an apocalyptic number.
It is an amenable number.
13439989697 is a deficient number, since it is larger than the sum of its proper divisors (1).
13439989697 is an equidigital number, since it uses as much as digits as its factorization.
13439989697 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 79361856, while the sum is 68.
The spelling of 13439989697 in words is "thirteen billion, four hundred thirty-nine million, nine hundred eighty-nine thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.248 sec. • engine limits •