Base | Representation |
---|---|
bin | 11000100101101110… |
… | …00100111101000101 |
3 | 1021002000122001021202 |
4 | 30102313010331011 |
5 | 204014020024424 |
6 | 10021542152245 |
7 | 645066311351 |
oct | 142267047505 |
9 | 37060561252 |
10 | 13201329989 |
11 | 5664896681 |
12 | 2685122685 |
13 | 1325003483 |
14 | 8d33b6461 |
15 | 523e702ae |
hex | 312dc4f45 |
13201329989 has 2 divisors, whose sum is σ = 13201329990. Its totient is φ = 13201329988.
The previous prime is 13201329961. The next prime is 13201330007. The reversal of 13201329989 is 98992310231.
13201329989 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12167193025 + 1034136964 = 110305^2 + 32158^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13201329989 is a prime.
It is a super-2 number, since 2×132013299892 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13201329289) 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, 6600664994 + 6600664995.
It is an arithmetic number, because the mean of its divisors is an integer number (6600664995).
Almost surely, 213201329989 is an apocalyptic number.
It is an amenable number.
13201329989 is a deficient number, since it is larger than the sum of its proper divisors (1).
13201329989 is an equidigital number, since it uses as much as digits as its factorization.
13201329989 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 209952, while the sum is 47.
The spelling of 13201329989 in words is "thirteen billion, two hundred one million, three hundred twenty-nine thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •