Base | Representation |
---|---|
bin | 1010001101000110001101… |
… | …0100111010000011010111 |
3 | 1110201122002112011011212111 |
4 | 2203101203110322003113 |
5 | 2432312301434032244 |
6 | 35510241420331451 |
7 | 2235425025631324 |
oct | 243214324720327 |
9 | 43648075134774 |
10 | 11220121002199 |
11 | 363647688594a |
12 | 131264b9a3b87 |
13 | 63508c205c95 |
14 | 2ab0b1a39b4b |
15 | 146cdb2ebe34 |
hex | a346353a0d7 |
11220121002199 has 4 divisors (see below), whose sum is σ = 11288956100536. Its totient is φ = 11151285903864.
The previous prime is 11220121002197. The next prime is 11220121002263. The reversal of 11220121002199 is 99120012102211.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11220121002199 - 21 = 11220121002197 is a prime.
It is a super-2 number, since 2×112201210021992 (a number of 27 digits) contains 22 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 11220121002199.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11220121002197) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 34417548924 + ... + 34417549249.
It is an arithmetic number, because the mean of its divisors is an integer number (2822239025134).
Almost surely, 211220121002199 is an apocalyptic number.
11220121002199 is a deficient number, since it is larger than the sum of its proper divisors (68835098337).
11220121002199 is an equidigital number, since it uses as much as digits as its factorization.
11220121002199 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68835098336.
The product of its (nonzero) digits is 1296, while the sum is 31.
The spelling of 11220121002199 in words is "eleven trillion, two hundred twenty billion, one hundred twenty-one million, two thousand, one hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •