Base | Representation |
---|---|
bin | 111101001010000110… |
… | …0011101011010011101 |
3 | 110112222222120011202211 |
4 | 1322110030131122131 |
5 | 4122433320004203 |
6 | 140200135320421 |
7 | 12326416512220 |
oct | 1722414353235 |
9 | 415888504684 |
10 | 131335313053 |
11 | 507763a663a |
12 | 21553b20111 |
13 | c500724bb9 |
14 | 64dc97d5b7 |
15 | 363a1cbc6d |
hex | 1e9431d69d |
131335313053 has 4 divisors (see below), whose sum is σ = 150097500640. Its totient is φ = 112573125468.
The previous prime is 131335313029. The next prime is 131335313111. The reversal of 131335313053 is 350313533131.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 350313533131 = 97 ⋅3611479723.
It is a cyclic number.
It is not a de Polignac number, because 131335313053 - 229 = 130798442141 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131335313953) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9381093783 + ... + 9381093796.
It is an arithmetic number, because the mean of its divisors is an integer number (37524375160).
Almost surely, 2131335313053 is an apocalyptic number.
It is an amenable number.
131335313053 is a deficient number, since it is larger than the sum of its proper divisors (18762187587).
131335313053 is an equidigital number, since it uses as much as digits as its factorization.
131335313053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18762187586.
The product of its (nonzero) digits is 18225, while the sum is 31.
Adding to 131335313053 its reverse (350313533131), we get a palindrome (481648846184).
The spelling of 131335313053 in words is "one hundred thirty-one billion, three hundred thirty-five million, three hundred thirteen thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •