Base | Representation |
---|---|
bin | 10100101111001010… |
… | …11010111110100001 |
3 | 1001201212220021122102 |
4 | 22113211122332201 |
5 | 140300033312113 |
6 | 5040421020145 |
7 | 542613552152 |
oct | 122745327641 |
9 | 31655807572 |
10 | 11133104033 |
11 | 47a338a927 |
12 | 21a8554655 |
13 | 108568bc2c |
14 | 77883b929 |
15 | 4525d2758 |
hex | 29795afa1 |
11133104033 has 4 divisors (see below), whose sum is σ = 11141495040. Its totient is φ = 11124713028.
The previous prime is 11133104009. The next prime is 11133104039. The reversal of 11133104033 is 33040133111.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 11133104033 - 212 = 11133099937 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11133103996 and 11133104014.
It is not an unprimeable number, because it can be changed into a prime (11133104039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4193513 + ... + 4196166.
It is an arithmetic number, because the mean of its divisors is an integer number (2785373760).
Almost surely, 211133104033 is an apocalyptic number.
It is an amenable number.
11133104033 is a deficient number, since it is larger than the sum of its proper divisors (8391007).
11133104033 is an equidigital number, since it uses as much as digits as its factorization.
11133104033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8391006.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 11133104033 its reverse (33040133111), we get a palindrome (44173237144).
The spelling of 11133104033 in words is "eleven billion, one hundred thirty-three million, one hundred four thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •