Base | Representation |
---|---|
bin | 10000010101001000011… |
… | …001110110010110001011 |
3 | 10222021121010112120201211 |
4 | 100111020121312112023 |
5 | 121341232001400021 |
6 | 2215310534153551 |
7 | 144035122546123 |
oct | 20251031662613 |
9 | 3867533476654 |
10 | 1122201200011 |
11 | 3a2a1735a181 |
12 | 1615a6ab28b7 |
13 | 81a91514808 |
14 | 3c459c5dc83 |
15 | 1e2ceac43e1 |
hex | 1054867658b |
1122201200011 has 8 divisors (see below), whose sum is σ = 1122857535744. Its totient is φ = 1121545028520.
The previous prime is 1122201199949. The next prime is 1122201200033. The reversal of 1122201200011 is 1100021022211.
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 1122201200011 - 219 = 1122200675723 is a prime.
It is a super-2 number, since 2×11222012000112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1122201199964 and 1122201200000.
It is not an unprimeable number, because it can be changed into a prime (1122201200111) 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, 15254860 + ... + 15328246.
It is an arithmetic number, because the mean of its divisors is an integer number (140357191968).
Almost surely, 21122201200011 is an apocalyptic number.
1122201200011 is a deficient number, since it is larger than the sum of its proper divisors (656335733).
1122201200011 is an equidigital number, since it uses as much as digits as its factorization.
1122201200011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 82121.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1122201200011 its reverse (1100021022211), we get a palindrome (2222222222222).
The spelling of 1122201200011 in words is "one trillion, one hundred twenty-two billion, two hundred one million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •