Base | Representation |
---|---|
bin | 11101110010011100110111… |
… | …100101110111011101011011 |
3 | 122011212110112110112021111111 |
4 | 131302130313211313131123 |
5 | 114132433113421301014 |
6 | 1142345151000041151 |
7 | 36411116601661222 |
oct | 3562346745673533 |
9 | 564773473467444 |
10 | 131010320103259 |
11 | 3882018a2a2483 |
12 | 1283a8171631b7 |
13 | 58142b29573ac |
14 | 244cd0d091cb9 |
15 | 1022d2bd4d2c4 |
hex | 77273797775b |
131010320103259 has 2 divisors, whose sum is σ = 131010320103260. Its totient is φ = 131010320103258.
The previous prime is 131010320103209. The next prime is 131010320103269. The reversal of 131010320103259 is 952301023010131.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 131010320103259 - 217 = 131010319972187 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 131010320103259.
It is not a weakly prime, because it can be changed into another prime (131010320103209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65505160051629 + 65505160051630.
It is an arithmetic number, because the mean of its divisors is an integer number (65505160051630).
Almost surely, 2131010320103259 is an apocalyptic number.
131010320103259 is a deficient number, since it is larger than the sum of its proper divisors (1).
131010320103259 is an equidigital number, since it uses as much as digits as its factorization.
131010320103259 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4860, while the sum is 31.
The spelling of 131010320103259 in words is "one hundred thirty-one trillion, ten billion, three hundred twenty million, one hundred three thousand, two hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •