Base | Representation |
---|---|
bin | 10100101100101100… |
… | …01100001111111011 |
3 | 1001200102211001222012 |
4 | 22112112030033323 |
5 | 140224224144311 |
6 | 5034355520135 |
7 | 542242166120 |
oct | 122626141773 |
9 | 31612731865 |
10 | 11112334331 |
11 | 479269428a |
12 | 21a15b904b |
13 | 1081299377 |
14 | 775b92747 |
15 | 45087d78b |
hex | 29658c3fb |
11112334331 has 8 divisors (see below), whose sum is σ = 12703425504. Its totient is φ = 9522146880.
The previous prime is 11112334327. The next prime is 11112334381. The reversal of 11112334331 is 13343321111.
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 11112334331 - 22 = 11112334327 is a prime.
It is a super-2 number, since 2×111123343312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11112334297 and 11112334306.
It is not an unprimeable number, because it can be changed into a prime (11112334381) 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, 199370 + ... + 248943.
It is an arithmetic number, because the mean of its divisors is an integer number (1587928188).
Almost surely, 211112334331 is an apocalyptic number.
11112334331 is a deficient number, since it is larger than the sum of its proper divisors (1591091173).
11112334331 is an equidigital number, since it uses as much as digits as its factorization.
11112334331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 451861.
The product of its digits is 648, while the sum is 23.
Adding to 11112334331 its reverse (13343321111), we get a palindrome (24455655442).
The spelling of 11112334331 in words is "eleven billion, one hundred twelve million, three hundred thirty-four thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •