Base | Representation |
---|---|
bin | 11101110101001110000101… |
… | …011101101011000011101101 |
3 | 122012112122200202101122122112 |
4 | 131311032011131223003231 |
5 | 114144042314403423211 |
6 | 1143012420444453405 |
7 | 36430634206046624 |
oct | 3565160535530355 |
9 | 565478622348575 |
10 | 131200605139181 |
11 | 38893956232346 |
12 | 1286b68124a265 |
13 | 58292193479c6 |
14 | 2458200c0a6bb |
15 | 1027c6746988b |
hex | 77538576b0ed |
131200605139181 has 2 divisors, whose sum is σ = 131200605139182. Its totient is φ = 131200605139180.
The previous prime is 131200605139169. The next prime is 131200605139207. The reversal of 131200605139181 is 181931506002131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 117777841502500 + 13422763636681 = 10852550^2 + 3663709^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131200605139181 is a prime.
It is a super-2 number, since 2×1312006051391812 (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 (131200602139181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65600302569590 + 65600302569591.
It is an arithmetic number, because the mean of its divisors is an integer number (65600302569591).
Almost surely, 2131200605139181 is an apocalyptic number.
It is an amenable number.
131200605139181 is a deficient number, since it is larger than the sum of its proper divisors (1).
131200605139181 is an equidigital number, since it uses as much as digits as its factorization.
131200605139181 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 38880, while the sum is 41.
The spelling of 131200605139181 in words is "one hundred thirty-one trillion, two hundred billion, six hundred five million, one hundred thirty-nine thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •