Base | Representation |
---|---|
bin | 10100100010000101… |
… | …00110000010111001 |
3 | 1001110020022012222000 |
4 | 22101002212002321 |
5 | 140033431423113 |
6 | 5021455451213 |
7 | 540111412020 |
oct | 122102460271 |
9 | 31406265860 |
10 | 11023311033 |
11 | 474740a809 |
12 | 2177826b09 |
13 | 10689c9b67 |
14 | 76801b8b7 |
15 | 447b46373 |
hex | 2910a60b9 |
11023311033 has 16 divisors (see below), whose sum is σ = 18663807360. Its totient is φ = 6299034768.
The previous prime is 11023311001. The next prime is 11023311067. The reversal of 11023311033 is 33011332011.
It is a happy number.
It is not a de Polignac number, because 11023311033 - 25 = 11023311001 is a prime.
It is a super-2 number, since 2×110233110332 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11023310997 and 11023311015.
It is not an unprimeable number, because it can be changed into a prime (11023310033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 29162010 + ... + 29162387.
It is an arithmetic number, because the mean of its divisors is an integer number (1166487960).
Almost surely, 211023311033 is an apocalyptic number.
It is an amenable number.
11023311033 is a deficient number, since it is larger than the sum of its proper divisors (7640496327).
11023311033 is an equidigital number, since it uses as much as digits as its factorization.
11023311033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58324413 (or 58324407 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 18.
Adding to 11023311033 its reverse (33011332011), we get a palindrome (44034643044).
The spelling of 11023311033 in words is "eleven billion, twenty-three million, three hundred eleven thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •