Base | Representation |
---|---|
bin | 11101111000001010100111… |
… | …000011101010101001111001 |
3 | 122020021000012020122022110021 |
4 | 131320022213003222221321 |
5 | 114210401402221210131 |
6 | 1143245415235250441 |
7 | 36451361430546154 |
oct | 3570124703525171 |
9 | 566230166568407 |
10 | 131403032210041 |
11 | 38961793015829 |
12 | 128a2955749a21 |
13 | 5842339440487 |
14 | 2463d25396c9b |
15 | 102d163a10e11 |
hex | 7782a70eaa79 |
131403032210041 has 2 divisors, whose sum is σ = 131403032210042. Its totient is φ = 131403032210040.
The previous prime is 131403032210029. The next prime is 131403032210089. The reversal of 131403032210041 is 140012230304131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 130824069487225 + 578962722816 = 11437835^2 + 760896^2 .
It is a cyclic number.
It is not a de Polignac number, because 131403032210041 - 29 = 131403032209529 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 131403032209988 and 131403032210015.
It is not a weakly prime, because it can be changed into another prime (131403032210011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65701516105020 + 65701516105021.
It is an arithmetic number, because the mean of its divisors is an integer number (65701516105021).
Almost surely, 2131403032210041 is an apocalyptic number.
It is an amenable number.
131403032210041 is a deficient number, since it is larger than the sum of its proper divisors (1).
131403032210041 is an equidigital number, since it uses as much as digits as its factorization.
131403032210041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 131403032210041 its reverse (140012230304131), we get a palindrome (271415262514172).
The spelling of 131403032210041 in words is "one hundred thirty-one trillion, four hundred three billion, thirty-two million, two hundred ten thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •