Base | Representation |
---|---|
bin | 10100101111000101… |
… | …00110101011011011 |
3 | 1001201211111202121111 |
4 | 22113202212223123 |
5 | 140244341144111 |
6 | 5040353121151 |
7 | 542604355120 |
oct | 122742465333 |
9 | 31654452544 |
10 | 11132365531 |
11 | 47a2a25aa1 |
12 | 21a82591b7 |
13 | 1085490a51 |
14 | 7786c8747 |
15 | 4524d8a21 |
hex | 2978a6adb |
11132365531 has 8 divisors (see below), whose sum is σ = 12754753760. Its totient is φ = 9517989888.
The previous prime is 11132365513. The next prime is 11132365553. The reversal of 11132365531 is 13556323111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11132365531 - 215 = 11132332763 is a prime.
It is a super-2 number, since 2×111323655312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11132365493 and 11132365502.
It is not an unprimeable number, because it can be changed into a prime (11132365511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2000166 + ... + 2005723.
It is an arithmetic number, because the mean of its divisors is an integer number (1594344220).
Almost surely, 211132365531 is an apocalyptic number.
11132365531 is a deficient number, since it is larger than the sum of its proper divisors (1622388229).
11132365531 is an equidigital number, since it uses as much as digits as its factorization.
11132365531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4006293.
The product of its digits is 8100, while the sum is 31.
Adding to 11132365531 its reverse (13556323111), we get a palindrome (24688688642).
The spelling of 11132365531 in words is "eleven billion, one hundred thirty-two million, three hundred sixty-five thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •