Base | Representation |
---|---|
bin | 1010000000111011111111… |
… | …0111010101010010011101 |
3 | 1102222122212212022111021200 |
4 | 2200032333313111102131 |
5 | 2420401434323224041 |
6 | 35230252405550113 |
7 | 2214351204555363 |
oct | 240167767252235 |
9 | 42878785274250 |
10 | 11011220133021 |
11 | 3565917780a19 |
12 | 129a06b415339 |
13 | 61b479b34814 |
14 | 2a0d35789633 |
15 | 14166172d1b6 |
hex | a03bfdd549d |
11011220133021 has 24 divisors (see below), whose sum is σ = 15920726016000. Its totient is φ = 7333601771232.
The previous prime is 11011220133013. The next prime is 11011220133059. The reversal of 11011220133021 is 12033102211011.
11011220133021 is a `hidden beast` number, since 1 + 1 + 0 + 112 + 201 + 330 + 21 = 666.
It is not a de Polignac number, because 11011220133021 - 23 = 11011220133013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11011220132985 and 11011220133003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11011220133061) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 58831375 + ... + 59018243.
It is an arithmetic number, because the mean of its divisors is an integer number (663363584000).
Almost surely, 211011220133021 is an apocalyptic number.
It is an amenable number.
11011220133021 is a deficient number, since it is larger than the sum of its proper divisors (4909505882979).
11011220133021 is a wasteful number, since it uses less digits than its factorization.
11011220133021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 193273 (or 193270 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 11011220133021 its reverse (12033102211011), we get a palindrome (23044322344032).
The spelling of 11011220133021 in words is "eleven trillion, eleven billion, two hundred twenty million, one hundred thirty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •