Base | Representation |
---|---|
bin | 11101110010011110100100… |
… | …010001001111101100110101 |
3 | 122011212122020112102001201111 |
4 | 131302132210101033230311 |
5 | 114133000332203222234 |
6 | 1142350051531555021 |
7 | 36411213021604201 |
oct | 3562364421175465 |
9 | 564778215361644 |
10 | 131012143414069 |
11 | 38820a35528915 |
12 | 1283b0458bba71 |
13 | 5814513619828 |
14 | 244d0432b5b01 |
15 | 1022dd6e5d664 |
hex | 7727a444fb35 |
131012143414069 has 2 divisors, whose sum is σ = 131012143414070. Its totient is φ = 131012143414068.
The previous prime is 131012143414063. The next prime is 131012143414133. The reversal of 131012143414069 is 960414341210131.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 108433443007044 + 22578700407025 = 10413138^2 + 4751705^2 .
It is a cyclic number.
It is not a de Polignac number, because 131012143414069 - 211 = 131012143412021 is a prime.
It is a super-2 number, since 2×1310121434140692 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131012143414063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65506071707034 + 65506071707035.
It is an arithmetic number, because the mean of its divisors is an integer number (65506071707035).
Almost surely, 2131012143414069 is an apocalyptic number.
It is an amenable number.
131012143414069 is a deficient number, since it is larger than the sum of its proper divisors (1).
131012143414069 is an equidigital number, since it uses as much as digits as its factorization.
131012143414069 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 62208, while the sum is 40.
The spelling of 131012143414069 in words is "one hundred thirty-one trillion, twelve billion, one hundred forty-three million, four hundred fourteen thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •