Base | Representation |
---|---|
bin | 1010000000010110010111… |
… | …1010010001110001011101 |
3 | 1102221200211001001110001111 |
4 | 2200011211322101301131 |
5 | 2420220243440133041 |
6 | 35221502322542021 |
7 | 2213543014540225 |
oct | 240054572216135 |
9 | 42850731043044 |
10 | 11001121021021 |
11 | 356160502166a |
12 | 1298111207911 |
13 | 61a52a754ac1 |
14 | 2a06583c7085 |
15 | 14126ece3981 |
hex | a0165e91c5d |
11001121021021 has 8 divisors (see below), whose sum is σ = 11008697382144. Its totient is φ = 10993547234880.
The previous prime is 11001121020983. The next prime is 11001121021027. The reversal of 11001121021021 is 12012012110011.
It is a happy number.
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 11001121021021 - 229 = 11000584150109 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11001121020992 and 11001121021010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11001121021027) 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, 7943190 + ... + 9224776.
It is an arithmetic number, because the mean of its divisors is an integer number (1376087172768).
Almost surely, 211001121021021 is an apocalyptic number.
It is an amenable number.
11001121021021 is a deficient number, since it is larger than the sum of its proper divisors (7576361123).
11001121021021 is a wasteful number, since it uses less digits than its factorization.
11001121021021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1287491.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11001121021021 its reverse (12012012110011), we get a palindrome (23013133131032).
The spelling of 11001121021021 in words is "eleven trillion, one billion, one hundred twenty-one million, twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •