Base | Representation |
---|---|
bin | 1010001101001101100111… |
… | …1001001011011010110001 |
3 | 1110201211020011020000102222 |
4 | 2203103121321023122301 |
5 | 2432330340204101001 |
6 | 35511211040250425 |
7 | 2235525232004060 |
oct | 243233171133261 |
9 | 43654204200388 |
10 | 11222110222001 |
11 | 36372a772a158 |
12 | 1312b06010a15 |
13 | 635318377613 |
14 | 2ab21dcca1d7 |
15 | 146da5c8061b |
hex | a34d9e4b6b1 |
11222110222001 has 8 divisors (see below), whose sum is σ = 13067255029824. Its totient is φ = 9437461965360.
The previous prime is 11222110221989. The next prime is 11222110222049. The reversal of 11222110222001 is 10022201122211.
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 11222110222001 - 222 = 11222106027697 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11222110222051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15124137395 + ... + 15124138136.
It is an arithmetic number, because the mean of its divisors is an integer number (1633406878728).
Almost surely, 211222110222001 is an apocalyptic number.
It is an amenable number.
11222110222001 is a deficient number, since it is larger than the sum of its proper divisors (1845144807823).
11222110222001 is an equidigital number, since it uses as much as digits as its factorization.
11222110222001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30248275591.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 11222110222001 its reverse (10022201122211), we get a palindrome (21244311344212).
The spelling of 11222110222001 in words is "eleven trillion, two hundred twenty-two billion, one hundred ten million, two hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •