Base | Representation |
---|---|
bin | 10101000110101010… |
… | …11011111011101001 |
3 | 1002020121211211200011 |
4 | 22203111123323221 |
5 | 141201020141413 |
6 | 5112142211521 |
7 | 550526311234 |
oct | 124325337351 |
9 | 32217754604 |
10 | 11330240233 |
11 | 4894697204 |
12 | 2242583ba1 |
13 | 10b7482880 |
14 | 796ab641b |
15 | 464a7333d |
hex | 2a355bee9 |
11330240233 has 8 divisors (see below), whose sum is σ = 12531576008. Its totient is φ = 10176015744.
The previous prime is 11330240213. The next prime is 11330240249. The reversal of 11330240233 is 33204203311.
It can be written as a sum of positive squares in 4 ways, for example, as 5757319129 + 5572921104 = 75877^2 + 74652^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11330240233 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11330240203) 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, 11777316 + ... + 11778277.
It is an arithmetic number, because the mean of its divisors is an integer number (1566447001).
Almost surely, 211330240233 is an apocalyptic number.
11330240233 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11330240233 is a deficient number, since it is larger than the sum of its proper divisors (1201335775).
11330240233 is a wasteful number, since it uses less digits than its factorization.
11330240233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23555643.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 11330240233 its reverse (33204203311), we get a palindrome (44534443544).
The spelling of 11330240233 in words is "eleven billion, three hundred thirty million, two hundred forty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •