Base | Representation |
---|---|
bin | 10100100001101101… |
… | …10011101100110001 |
3 | 1001110000111020112222 |
4 | 22100312303230301 |
5 | 140032134034413 |
6 | 5021305330425 |
7 | 540043222610 |
oct | 122066635461 |
9 | 31400436488 |
10 | 11020221233 |
11 | 474569a35a |
12 | 2176796a15 |
13 | 1068187688 |
14 | 767855877 |
15 | 447735b08 |
hex | 290db3b31 |
11020221233 has 8 divisors (see below), whose sum is σ = 12641015040. Its totient is φ = 9411046560.
The previous prime is 11020221169. The next prime is 11020221239. The reversal of 11020221233 is 33212202011.
11020221233 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 not a de Polignac number, because 11020221233 - 26 = 11020221169 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (11020221239) 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, 2902748 + ... + 2906541.
It is an arithmetic number, because the mean of its divisors is an integer number (1580126880).
Almost surely, 211020221233 is an apocalyptic number.
It is an amenable number.
11020221233 is a deficient number, since it is larger than the sum of its proper divisors (1620793807).
11020221233 is an equidigital number, since it uses as much as digits as its factorization.
11020221233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5809567.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 11020221233 its reverse (33212202011), we get a palindrome (44232423244).
The spelling of 11020221233 in words is "eleven billion, twenty million, two hundred twenty-one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •