Base | Representation |
---|---|
bin | 111101000011111111… |
… | …0011001111000000101 |
3 | 110112110200210112102021 |
4 | 1322013332121320011 |
5 | 4122023324130312 |
6 | 140123533243141 |
7 | 12321350114224 |
oct | 1720776317005 |
9 | 415420715367 |
10 | 131130301957 |
11 | 50680700786 |
12 | 214b73334b1 |
13 | c49a104a65 |
14 | 64bd654cbb |
15 | 36271d2c07 |
hex | 1e87f99e05 |
131130301957 has 2 divisors, whose sum is σ = 131130301958. Its totient is φ = 131130301956.
The previous prime is 131130301949. The next prime is 131130301961. The reversal of 131130301957 is 759103031131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 104850325636 + 26279976321 = 323806^2 + 162111^2 .
It is a cyclic number.
It is not a de Polignac number, because 131130301957 - 23 = 131130301949 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131130308957) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65565150978 + 65565150979.
It is an arithmetic number, because the mean of its divisors is an integer number (65565150979).
Almost surely, 2131130301957 is an apocalyptic number.
It is an amenable number.
131130301957 is a deficient number, since it is larger than the sum of its proper divisors (1).
131130301957 is an equidigital number, since it uses as much as digits as its factorization.
131130301957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8505, while the sum is 34.
The spelling of 131130301957 in words is "one hundred thirty-one billion, one hundred thirty million, three hundred one thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •