Base | Representation |
---|---|
bin | 11101110100011111000100… |
… | …011100011010101110000101 |
3 | 122012100211101111202221222112 |
4 | 131310133010130122232011 |
5 | 114142230422233322143 |
6 | 1142533311231310405 |
7 | 36424166200630334 |
oct | 3564370434325605 |
9 | 565324344687875 |
10 | 131150122167173 |
11 | 388744aa98327a |
12 | 1286193267b405 |
13 | 5824532505635 |
14 | 24559b22b7d1b |
15 | 10267b04c1e18 |
hex | 7747c471ab85 |
131150122167173 has 2 divisors, whose sum is σ = 131150122167174. Its totient is φ = 131150122167172.
The previous prime is 131150122167151. The next prime is 131150122167193. The reversal of 131150122167173 is 371761221051131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 122777768343169 + 8372353824004 = 11080513^2 + 2893502^2 .
It is a cyclic number.
It is not a de Polignac number, because 131150122167173 - 228 = 131149853731717 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 131150122167173.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131150122167193) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65575061083586 + 65575061083587.
It is an arithmetic number, because the mean of its divisors is an integer number (65575061083587).
Almost surely, 2131150122167173 is an apocalyptic number.
It is an amenable number.
131150122167173 is a deficient number, since it is larger than the sum of its proper divisors (1).
131150122167173 is an equidigital number, since it uses as much as digits as its factorization.
131150122167173 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 52920, while the sum is 41.
The spelling of 131150122167173 in words is "one hundred thirty-one trillion, one hundred fifty billion, one hundred twenty-two million, one hundred sixty-seven thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •