Base | Representation |
---|---|
bin | 10100101011001111… |
… | …00010000101111001 |
3 | 1001122120210122210011 |
4 | 22111213202011321 |
5 | 140213111244113 |
6 | 5033241421521 |
7 | 542033214265 |
oct | 122547420571 |
9 | 31576718704 |
10 | 11100103033 |
11 | 478679a778 |
12 | 219949a8a1 |
13 | 107b8a6006 |
14 | 7742cb0a5 |
15 | 44e76463d |
hex | 2959e2179 |
11100103033 has 8 divisors (see below), whose sum is σ = 11367526016. Its totient is φ = 10833102000.
The previous prime is 11100102997. The next prime is 11100103037. The reversal of 11100103033 is 33030100111.
It is a happy number.
11100103033 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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-11100103033 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11100103037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 51918 + ... + 157783.
It is an arithmetic number, because the mean of its divisors is an integer number (1420940752).
Almost surely, 211100103033 is an apocalyptic number.
It is an amenable number.
11100103033 is a deficient number, since it is larger than the sum of its proper divisors (267422983).
11100103033 is a wasteful number, since it uses less digits than its factorization.
11100103033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 210975.
The product of its (nonzero) digits is 27, while the sum is 13.
Adding to 11100103033 its reverse (33030100111), we get a palindrome (44130203144).
The spelling of 11100103033 in words is "eleven billion, one hundred million, one hundred three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •