Base | Representation |
---|---|
bin | 10000111100000110111… |
… | …010011110110101101101 |
3 | 11010021121210110011110121 |
4 | 100330012322132311231 |
5 | 123032434321144211 |
6 | 2250431433004541 |
7 | 150046203600532 |
oct | 20740672366555 |
9 | 4107553404417 |
10 | 1164052131181 |
11 | 4097430991a5 |
12 | 169726853751 |
13 | 85a00baa304 |
14 | 404aa1a0d89 |
15 | 2042dd25271 |
hex | 10f06e9ed6d |
1164052131181 has 16 divisors (see below), whose sum is σ = 1184447819520. Its totient is φ = 1143822176640.
The previous prime is 1164052131149. The next prime is 1164052131191. The reversal of 1164052131181 is 1811312504611.
It is a cyclic number.
It is not a de Polignac number, because 1164052131181 - 25 = 1164052131149 is a prime.
It is a super-2 number, since 2×11640521311812 (a number of 25 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 (1164052131131) 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 in 15 ways as a sum of consecutive naturals, for example, 127534840 + ... + 127543966.
It is an arithmetic number, because the mean of its divisors is an integer number (74027988720).
Almost surely, 21164052131181 is an apocalyptic number.
It is an amenable number.
1164052131181 is a deficient number, since it is larger than the sum of its proper divisors (20395688339).
1164052131181 is an equidigital number, since it uses as much as digits as its factorization.
1164052131181 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17964.
The product of its (nonzero) digits is 5760, while the sum is 34.
Adding to 1164052131181 its reverse (1811312504611), we get a palindrome (2975364635792).
The spelling of 1164052131181 in words is "one trillion, one hundred sixty-four billion, fifty-two million, one hundred thirty-one thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •