Base | Representation |
---|---|
bin | 10100101111001010… |
… | …10001110111101101 |
3 | 1001201212211101110221 |
4 | 22113211101313231 |
5 | 140300031113413 |
6 | 5040420131341 |
7 | 542613335335 |
oct | 122745216755 |
9 | 31655741427 |
10 | 11133066733 |
11 | 47a33648a8 |
12 | 21a8536b51 |
13 | 1085677c69 |
14 | 77882c0c5 |
15 | 4525c668d |
hex | 297951ded |
11133066733 has 4 divisors (see below), whose sum is σ = 11404604988. Its totient is φ = 10861528480.
The previous prime is 11133066731. The next prime is 11133066803. The reversal of 11133066733 is 33766033111.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 5172917929 + 5960148804 = 71923^2 + 77202^2 .
It is a cyclic number.
It is not a de Polignac number, because 11133066733 - 21 = 11133066731 is a prime.
It is a super-4 number, since 4×111330667334 (a number of 41 digits) contains 4444 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11133066731) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 135769066 + ... + 135769147.
It is an arithmetic number, because the mean of its divisors is an integer number (2851151247).
Almost surely, 211133066733 is an apocalyptic number.
It is an amenable number.
11133066733 is a deficient number, since it is larger than the sum of its proper divisors (271538255).
11133066733 is an equidigital number, since it uses as much as digits as its factorization.
11133066733 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 271538254.
The product of its (nonzero) digits is 20412, while the sum is 34.
Adding to 11133066733 its reverse (33766033111), we get a palindrome (44899099844).
The spelling of 11133066733 in words is "eleven billion, one hundred thirty-three million, sixty-six thousand, seven hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •