Base | Representation |
---|---|
bin | 10100111100010010… |
… | …00010000001111101 |
3 | 1002000112212202221112 |
4 | 22132021002001331 |
5 | 141011213233313 |
6 | 5055350411405 |
7 | 545420536001 |
oct | 123611020175 |
9 | 32015782845 |
10 | 11243102333 |
11 | 484a490211 |
12 | 2219360b65 |
13 | 10a23c3598 |
14 | 7892b2701 |
15 | 45c0ae8a8 |
hex | 29e24207d |
11243102333 has 8 divisors (see below), whose sum is σ = 11452894200. Its totient is φ = 11034132480.
The previous prime is 11243102327. The next prime is 11243102401. The reversal of 11243102333 is 33320134211.
It can be written as a sum of positive squares in 4 ways, for example, as 18335524 + 11224766809 = 4282^2 + 105947^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 11243102333 - 28 = 11243102077 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11243102299 and 11243102308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11243102323) 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, 177860 + ... + 232637.
It is an arithmetic number, because the mean of its divisors is an integer number (1431611775).
Almost surely, 211243102333 is an apocalyptic number.
It is an amenable number.
11243102333 is a deficient number, since it is larger than the sum of its proper divisors (209791867).
11243102333 is an equidigital number, since it uses as much as digits as its factorization.
11243102333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 411007.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 11243102333 its reverse (33320134211), we get a palindrome (44563236544).
The spelling of 11243102333 in words is "eleven billion, two hundred forty-three million, one hundred two thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •