Base | Representation |
---|---|
bin | 1010000111011000101011… |
… | …1010111000110000110001 |
3 | 1110101020211101002201221211 |
4 | 2201312022322320300301 |
5 | 2424210324230201001 |
6 | 35353213212520121 |
7 | 2225352360565162 |
oct | 241661272706061 |
9 | 43336741081854 |
10 | 11122001022001 |
11 | 35a88a5699521 |
12 | 12b7627780041 |
13 | 628a530529bc |
14 | 2a6444561769 |
15 | 144497175351 |
hex | a1d8aeb8c31 |
11122001022001 has 4 divisors (see below), whose sum is σ = 11122502193252. Its totient is φ = 11121499850752.
The previous prime is 11122001021993. The next prime is 11122001022127. The reversal of 11122001022001 is 10022010022111.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 6824236680976 + 4297764341025 = 2612324^2 + 2073105^2 .
It is a cyclic number.
It is not a de Polignac number, because 11122001022001 - 23 = 11122001021993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11122001062001) 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, 250552336 + ... + 250596721.
It is an arithmetic number, because the mean of its divisors is an integer number (2780625548313).
Almost surely, 211122001022001 is an apocalyptic number.
It is an amenable number.
11122001022001 is a deficient number, since it is larger than the sum of its proper divisors (501171251).
11122001022001 is an equidigital number, since it uses as much as digits as its factorization.
11122001022001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 501171250.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 11122001022001 its reverse (10022010022111), we get a palindrome (21144011044112).
The spelling of 11122001022001 in words is "eleven trillion, one hundred twenty-two billion, one million, twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •