Base | Representation |
---|---|
bin | 11101110101010010010010… |
… | …101101110100101100010101 |
3 | 122012120002100120111111222101 |
4 | 131311102102231310230111 |
5 | 114144131042321202203 |
6 | 1143014445014202101 |
7 | 36431154150362650 |
oct | 3565222255645425 |
9 | 565502316444871 |
10 | 131205122444053 |
11 | 38895864122359 |
12 | 12870522053331 |
13 | 582978919cc78 |
14 | 245850cb3c897 |
15 | 1027e2dd2541d |
hex | 775492b74b15 |
131205122444053 has 16 divisors (see below), whose sum is σ = 154929734228736. Its totient is φ = 108785538650880.
The previous prime is 131205122444027. The next prime is 131205122444059. The reversal of 131205122444053 is 350444221502131.
It is not a de Polignac number, because 131205122444053 - 29 = 131205122443541 is a prime.
It is a super-2 number, since 2×1312051224440532 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131205122444059) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2490485076 + ... + 2490537757.
It is an arithmetic number, because the mean of its divisors is an integer number (9683108389296).
Almost surely, 2131205122444053 is an apocalyptic number.
It is an amenable number.
131205122444053 is a deficient number, since it is larger than the sum of its proper divisors (23724611784683).
131205122444053 is an equidigital number, since it uses as much as digits as its factorization.
131205122444053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4981022964.
The product of its (nonzero) digits is 115200, while the sum is 37.
Adding to 131205122444053 its reverse (350444221502131), we get a palindrome (481649343946184).
The spelling of 131205122444053 in words is "one hundred thirty-one trillion, two hundred five billion, one hundred twenty-two million, four hundred forty-four thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •