Base | Representation |
---|---|
bin | 111101001010001111… |
… | …0010011000001001101 |
3 | 110120000022100202001121 |
4 | 1322110132103001031 |
5 | 4122441014122234 |
6 | 140200423440541 |
7 | 12326504326012 |
oct | 1722436230115 |
9 | 416008322047 |
10 | 131339989069 |
11 | 50778aaa813 |
12 | 215555b6151 |
13 | c5016a1383 |
14 | 64dd439709 |
15 | 363a8024b4 |
hex | 1e9479304d |
131339989069 has 2 divisors, whose sum is σ = 131339989070. Its totient is φ = 131339989068.
The previous prime is 131339989063. The next prime is 131339989097. The reversal of 131339989069 is 960989933131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 128836487844 + 2503501225 = 358938^2 + 50035^2 .
It is an emirp because it is prime and its reverse (960989933131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 131339989069 - 223 = 131331600461 is a prime.
It is a super-2 number, since 2×1313399890692 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 131339988998 and 131339989016.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131339989063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65669994534 + 65669994535.
It is an arithmetic number, because the mean of its divisors is an integer number (65669994535).
Almost surely, 2131339989069 is an apocalyptic number.
It is an amenable number.
131339989069 is a deficient number, since it is larger than the sum of its proper divisors (1).
131339989069 is an equidigital number, since it uses as much as digits as its factorization.
131339989069 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8503056, while the sum is 61.
The spelling of 131339989069 in words is "one hundred thirty-one billion, three hundred thirty-nine million, nine hundred eighty-nine thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •