Base | Representation |
---|---|
bin | 11101110100010110111100… |
… | …110001000000001001100111 |
3 | 122012022222212212220021000222 |
4 | 131310112330301000021213 |
5 | 114142110043233123142 |
6 | 1142525310134154555 |
7 | 36423440141500301 |
oct | 3564267461001147 |
9 | 565288785807028 |
10 | 131141403411047 |
11 | 388708364157a7 |
12 | 128600ba7b2a5b |
13 | 58237730b6c43 |
14 | 24553c6392971 |
15 | 102644ed4bbd2 |
hex | 7745bcc40267 |
131141403411047 has 2 divisors, whose sum is σ = 131141403411048. Its totient is φ = 131141403411046.
The previous prime is 131141403411013. The next prime is 131141403411167. The reversal of 131141403411047 is 740114304141131.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 131141403411047 - 210 = 131141403410023 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 131141403410998 and 131141403411016.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131141403411647) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65570701705523 + 65570701705524.
It is an arithmetic number, because the mean of its divisors is an integer number (65570701705524).
Almost surely, 2131141403411047 is an apocalyptic number.
131141403411047 is a deficient number, since it is larger than the sum of its proper divisors (1).
131141403411047 is an equidigital number, since it uses as much as digits as its factorization.
131141403411047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16128, while the sum is 35.
Adding to 131141403411047 its reverse (740114304141131), we get a palindrome (871255707552178).
The spelling of 131141403411047 in words is "one hundred thirty-one trillion, one hundred forty-one billion, four hundred three million, four hundred eleven thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •