Base | Representation |
---|---|
bin | 11101111001000001101010… |
… | …001110110100000100000011 |
3 | 122020110122202122202101011211 |
4 | 131321001222032310010003 |
5 | 114212333431130423011 |
6 | 1143332512435350551 |
7 | 36455553261325006 |
oct | 3571015216640403 |
9 | 566418678671154 |
10 | 131462141264131 |
11 | 38984865594a57 |
12 | 128b22b1152457 |
13 | 5847a99424122 |
14 | 2466b317a953d |
15 | 102e972e24b21 |
hex | 77906a3b4103 |
131462141264131 has 2 divisors, whose sum is σ = 131462141264132. Its totient is φ = 131462141264130.
The previous prime is 131462141263991. The next prime is 131462141264161.
131462141264131 is nontrivially palindromic in base 10.
It is a strong prime.
It is a palprime.
It is a cyclic number.
It is not a de Polignac number, because 131462141264131 - 211 = 131462141262083 is a prime.
It is a super-2 number, since 2×1314621412641312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (131462141264161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65731070632065 + 65731070632066.
It is an arithmetic number, because the mean of its divisors is an integer number (65731070632066).
Almost surely, 2131462141264131 is an apocalyptic number.
131462141264131 is a deficient number, since it is larger than the sum of its proper divisors (1).
131462141264131 is an equidigital number, since it uses as much as digits as its factorization.
131462141264131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 82944, while the sum is 40.
The spelling of 131462141264131 in words is "one hundred thirty-one trillion, four hundred sixty-two billion, one hundred forty-one million, two hundred sixty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •