Base | Representation |
---|---|
bin | 11101110101001110100101… |
… | …011110000011110101011101 |
3 | 122012112201002011210200022012 |
4 | 131311032211132003311131 |
5 | 114144044414340032311 |
6 | 1143012550030001005 |
7 | 36430653416202053 |
oct | 3565164536036535 |
9 | 565481064720265 |
10 | 131201142111581 |
11 | 38894101351693 |
12 | 1286b7b1046165 |
13 | 58292a3676559 |
14 | 24582522681d3 |
15 | 1027c9968778b |
hex | 7753a5783d5d |
131201142111581 has 2 divisors, whose sum is σ = 131201142111582. Its totient is φ = 131201142111580.
The previous prime is 131201142111547. The next prime is 131201142111593. The reversal of 131201142111581 is 185111241102131.
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., 125119325205625 + 6081816905956 = 11185675^2 + 2466134^2 .
It is a cyclic number.
It is not a de Polignac number, because 131201142111581 - 222 = 131201137917277 is a prime.
It is a super-2 number, since 2×1312011421115812 (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 (131201142111181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65600571055790 + 65600571055791.
It is an arithmetic number, because the mean of its divisors is an integer number (65600571055791).
Almost surely, 2131201142111581 is an apocalyptic number.
It is an amenable number.
131201142111581 is a deficient number, since it is larger than the sum of its proper divisors (1).
131201142111581 is an equidigital number, since it uses as much as digits as its factorization.
131201142111581 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1920, while the sum is 32.
The spelling of 131201142111581 in words is "one hundred thirty-one trillion, two hundred one billion, one hundred forty-two million, one hundred eleven thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •