Base | Representation |
---|---|
bin | 11101110111001010011010… |
… | …011101100111101011011101 |
3 | 122020000102021100020000210222 |
4 | 131313022122131213223131 |
5 | 114203234214431324203 |
6 | 1143154015301411125 |
7 | 36443401315606601 |
oct | 3567123235475335 |
9 | 566012240200728 |
10 | 131334101433053 |
11 | 38935530427842 |
12 | 12891518a09aa5 |
13 | 58389a268bc7c |
14 | 246086678b501 |
15 | 102b47c207038 |
hex | 77729a767add |
131334101433053 has 2 divisors, whose sum is σ = 131334101433054. Its totient is φ = 131334101433052.
The previous prime is 131334101433001. The next prime is 131334101433167. The reversal of 131334101433053 is 350334101433131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 126353179120249 + 4980922312804 = 11240693^2 + 2231798^2 .
It is a cyclic number.
It is not a de Polignac number, because 131334101433053 - 210 = 131334101432029 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131334101433553) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65667050716526 + 65667050716527.
It is an arithmetic number, because the mean of its divisors is an integer number (65667050716527).
Almost surely, 2131334101433053 is an apocalyptic number.
It is an amenable number.
131334101433053 is a deficient number, since it is larger than the sum of its proper divisors (1).
131334101433053 is an equidigital number, since it uses as much as digits as its factorization.
131334101433053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 58320, while the sum is 35.
Adding to 131334101433053 its reverse (350334101433131), we get a palindrome (481668202866184).
The spelling of 131334101433053 in words is "one hundred thirty-one trillion, three hundred thirty-four billion, one hundred one million, four hundred thirty-three thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.165 sec. • engine limits •