Base | Representation |
---|---|
bin | 10100101101110001… |
… | …00000100000111001 |
3 | 1001201001202010000202 |
4 | 22112320200200321 |
5 | 140234030031413 |
6 | 5035320411545 |
7 | 542411514206 |
oct | 122670404071 |
9 | 31631663022 |
10 | 11121330233 |
11 | 4797779012 |
12 | 21a4616bb5 |
13 | 10830c8ba0 |
14 | 777054cad |
15 | 451558e58 |
hex | 296e20839 |
11121330233 has 8 divisors (see below), whose sum is σ = 12100290888. Its totient is φ = 10160008704.
The previous prime is 11121330217. The next prime is 11121330239. The reversal of 11121330233 is 33203312111.
It can be written as a sum of positive squares in 4 ways, for example, as 759718969 + 10361611264 = 27563^2 + 101792^2 .
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 11121330233 - 24 = 11121330217 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11121330239) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4408466 + ... + 4410987.
It is an arithmetic number, because the mean of its divisors is an integer number (1512536361).
Almost surely, 211121330233 is an apocalyptic number.
11121330233 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11121330233 is a deficient number, since it is larger than the sum of its proper divisors (978960655).
11121330233 is an equidigital number, since it uses as much as digits as its factorization.
11121330233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8819563.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 11121330233 its reverse (33203312111), we get a palindrome (44324642344).
The spelling of 11121330233 in words is "eleven billion, one hundred twenty-one million, three hundred thirty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •