Base | Representation |
---|---|
bin | 1010000111010010000011… |
… | …0101000010000000010011 |
3 | 1110101002020022212102212111 |
4 | 2201310200311002000103 |
5 | 2424143203100231344 |
6 | 35352320431010151 |
7 | 2225260305532264 |
oct | 241644065020023 |
9 | 43332208772774 |
10 | 11120221102099 |
11 | 35a80719aa33a |
12 | 12b720b669957 |
13 | 62882b373665 |
14 | 2a6315dd496b |
15 | 1443e0c86834 |
hex | a1d20d42013 |
11120221102099 has 8 divisors (see below), whose sum is σ = 11123283765312. Its totient is φ = 11117158740480.
The previous prime is 11120221102061. The next prime is 11120221102127. The reversal of 11120221102099 is 99020112202111.
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-11120221102099 is a prime.
It is a super-3 number, since 3×111202211020993 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11120221102099.
It is not an unprimeable number, because it can be changed into a prime (11120221103099) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 87185857 + ... + 87313309.
It is an arithmetic number, because the mean of its divisors is an integer number (1390410470664).
Almost surely, 211120221102099 is an apocalyptic number.
11120221102099 is a deficient number, since it is larger than the sum of its proper divisors (3062663213).
11120221102099 is a wasteful number, since it uses less digits than its factorization.
11120221102099 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150797.
The product of its (nonzero) digits is 1296, while the sum is 31.
The spelling of 11120221102099 in words is "eleven trillion, one hundred twenty billion, two hundred twenty-one million, one hundred two thousand, ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •