Base | Representation |
---|---|
bin | 111101000000110110… |
… | …1111100010000100001 |
3 | 110112012101021001102021 |
4 | 1322001231330100201 |
5 | 4121314440314131 |
6 | 140105303221441 |
7 | 12315633604234 |
oct | 1720155742041 |
9 | 415171231367 |
10 | 131025323041 |
11 | 50627419548 |
12 | 21488147881 |
13 | c481439c62 |
14 | 64ad72941b |
15 | 361cd97e11 |
hex | 1e81b7c421 |
131025323041 has 2 divisors, whose sum is σ = 131025323042. Its totient is φ = 131025323040.
The previous prime is 131025322991. The next prime is 131025323069. The reversal of 131025323041 is 140323520131.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 123608496400 + 7416826641 = 351580^2 + 86121^2 .
It is a cyclic number.
It is not a de Polignac number, because 131025323041 - 227 = 130891105313 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 131025322997 and 131025323015.
It is not a weakly prime, because it can be changed into another prime (131025323941) 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, 65512661520 + 65512661521.
It is an arithmetic number, because the mean of its divisors is an integer number (65512661521).
Almost surely, 2131025323041 is an apocalyptic number.
It is an amenable number.
131025323041 is a deficient number, since it is larger than the sum of its proper divisors (1).
131025323041 is an equidigital number, since it uses as much as digits as its factorization.
131025323041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 25.
Adding to 131025323041 its reverse (140323520131), we get a palindrome (271348843172).
The spelling of 131025323041 in words is "one hundred thirty-one billion, twenty-five million, three hundred twenty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •