Base | Representation |
---|---|
bin | 111101000011001001… |
… | …0111001100000010101 |
3 | 110112101201202201222111 |
4 | 1322012102321200111 |
5 | 4121444120314312 |
6 | 140121045231021 |
7 | 12320555430034 |
oct | 1720622714025 |
9 | 415351681874 |
10 | 131102119957 |
11 | 50666802176 |
12 | 214a9a02471 |
13 | c494318413 |
14 | 64b99da71b |
15 | 36249b78a7 |
hex | 1e864b9815 |
131102119957 has 2 divisors, whose sum is σ = 131102119958. Its totient is φ = 131102119956.
The previous prime is 131102119937. The next prime is 131102120041. The reversal of 131102119957 is 759911201131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 110432594596 + 20669525361 = 332314^2 + 143769^2 .
It is an emirp because it is prime and its reverse (759911201131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 131102119957 - 231 = 128954636309 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131102119927) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65551059978 + 65551059979.
It is an arithmetic number, because the mean of its divisors is an integer number (65551059979).
Almost surely, 2131102119957 is an apocalyptic number.
It is an amenable number.
131102119957 is a deficient number, since it is larger than the sum of its proper divisors (1).
131102119957 is an equidigital number, since it uses as much as digits as its factorization.
131102119957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17010, while the sum is 40.
The spelling of 131102119957 in words is "one hundred thirty-one billion, one hundred two million, one hundred nineteen thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •