Base | Representation |
---|---|
bin | 10100111100000100… |
… | …10001111001101011 |
3 | 1002000102112211221220 |
4 | 22132002101321223 |
5 | 141010240113311 |
6 | 5055244433123 |
7 | 545366514435 |
oct | 123602217153 |
9 | 32012484856 |
10 | 11241332331 |
11 | 48494913a9 |
12 | 22188487a3 |
13 | 10a1c23a48 |
14 | 788d71655 |
15 | 45bd60206 |
hex | 29e091e6b |
11241332331 has 8 divisors (see below), whose sum is σ = 15870116304. Its totient is φ = 7053384960.
The previous prime is 11241332329. The next prime is 11241332339. The reversal of 11241332331 is 13323314211.
11241332331 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11241332331 - 21 = 11241332329 is a prime.
It is a super-2 number, since 2×112413323312 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11241332339) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 110209090 + ... + 110209191.
It is an arithmetic number, because the mean of its divisors is an integer number (1983764538).
Almost surely, 211241332331 is an apocalyptic number.
11241332331 is a deficient number, since it is larger than the sum of its proper divisors (4628783973).
11241332331 is a wasteful number, since it uses less digits than its factorization.
11241332331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 220418301.
The product of its digits is 1296, while the sum is 24.
Adding to 11241332331 its reverse (13323314211), we get a palindrome (24564646542).
The spelling of 11241332331 in words is "eleven billion, two hundred forty-one million, three hundred thirty-two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •