Base | Representation |
---|---|
bin | 11101100101101111101111… |
… | …100101100100001101100101 |
3 | 122001202222221120102202111111 |
4 | 131211233233211210031211 |
5 | 114024132023312010111 |
6 | 1140440115252305021 |
7 | 36261050653015303 |
oct | 3545575745441545 |
9 | 561688846382444 |
10 | 130137233703781 |
11 | 38513988834047 |
12 | 12719574312171 |
13 | 577cb71cba9c5 |
14 | 241c96625b273 |
15 | 100a27c4dba21 |
hex | 765bef964365 |
130137233703781 has 2 divisors, whose sum is σ = 130137233703782. Its totient is φ = 130137233703780.
The previous prime is 130137233703611. The next prime is 130137233703941. The reversal of 130137233703781 is 187307332731031.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 91087745120100 + 39049488583681 = 9543990^2 + 6248959^2 .
It is a cyclic number.
It is not a de Polignac number, because 130137233703781 - 219 = 130137233179493 is a prime.
It is a super-2 number, since 2×1301372337037812 (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 (130137233733781) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65068616851890 + 65068616851891.
It is an arithmetic number, because the mean of its divisors is an integer number (65068616851891).
Almost surely, 2130137233703781 is an apocalyptic number.
It is an amenable number.
130137233703781 is a deficient number, since it is larger than the sum of its proper divisors (1).
130137233703781 is an equidigital number, since it uses as much as digits as its factorization.
130137233703781 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1333584, while the sum is 49.
The spelling of 130137233703781 in words is "one hundred thirty trillion, one hundred thirty-seven billion, two hundred thirty-three million, seven hundred three thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •