Base | Representation |
---|---|
bin | 1010011110000110110100… |
… | …1111100111100011111111 |
3 | 1111202120101010110200221101 |
4 | 2213201231033213203333 |
5 | 3002104240330222111 |
6 | 40252410502313531 |
7 | 2265511434212605 |
oct | 247415517474377 |
9 | 44676333420841 |
10 | 11512345164031 |
11 | 37393a379a908 |
12 | 135b2051288a7 |
13 | 6567c00885ca |
14 | 2bb2b4185875 |
15 | 14e6e0eddbc1 |
hex | a786d3e78ff |
11512345164031 has 4 divisors (see below), whose sum is σ = 11512765948864. Its totient is φ = 11511924379200.
The previous prime is 11512345164013. The next prime is 11512345164043. The reversal of 11512345164031 is 13046154321511.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11512345164031 - 27 = 11512345163903 is a prime.
It is a super-2 number, since 2×115123451640312 (a number of 27 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 (11512345164091) 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, 210351375 + ... + 210406096.
It is an arithmetic number, because the mean of its divisors is an integer number (2878191487216).
Almost surely, 211512345164031 is an apocalyptic number.
11512345164031 is a deficient number, since it is larger than the sum of its proper divisors (420784833).
11512345164031 is an equidigital number, since it uses as much as digits as its factorization.
11512345164031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 420784832.
The product of its (nonzero) digits is 43200, while the sum is 37.
Adding to 11512345164031 its reverse (13046154321511), we get a palindrome (24558499485542).
The spelling of 11512345164031 in words is "eleven trillion, five hundred twelve billion, three hundred forty-five million, one hundred sixty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •