Base | Representation |
---|---|
bin | 1010000001100000110011… |
… | …1000011110010001101011 |
3 | 1110000121101120012010110100 |
4 | 2200120030320132101223 |
5 | 2421032204131242303 |
6 | 35235005141120443 |
7 | 2215151121056016 |
oct | 240301470362153 |
9 | 43017346163410 |
10 | 11021102212203 |
11 | 356a028974306 |
12 | 129bb689b9123 |
13 | 61c393275555 |
14 | 2a15d1db437d |
15 | 141a3e0968a3 |
hex | a060ce1e46b |
11021102212203 has 24 divisors (see below), whose sum is σ = 15950198400656. Its totient is φ = 7333182331200.
The previous prime is 11021102212199. The next prime is 11021102212229. The reversal of 11021102212203 is 30221220112011.
11021102212203 is a `hidden beast` number, since 1 + 10 + 211 + 0 + 221 + 220 + 3 = 666.
It is not a de Polignac number, because 11021102212203 - 22 = 11021102212199 is a prime.
It is a super-2 number, since 2×110211022122032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11021102222203) 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 23 ways as a sum of consecutive naturals, for example, 13714401 + ... + 14495757.
Almost surely, 211021102212203 is an apocalyptic number.
11021102212203 is a deficient number, since it is larger than the sum of its proper divisors (4929096188453).
11021102212203 is a wasteful number, since it uses less digits than its factorization.
11021102212203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 784395 (or 784392 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 11021102212203 its reverse (30221220112011), we get a palindrome (41242322324214).
The spelling of 11021102212203 in words is "eleven trillion, twenty-one billion, one hundred two million, two hundred twelve thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •