Base | Representation |
---|---|
bin | 1010000110001010111001… |
… | …1011101111110001100101 |
3 | 1110022020221021112121222112 |
4 | 2201202232123233301211 |
5 | 2423340044213031041 |
6 | 35335441323010405 |
7 | 2224013103052622 |
oct | 241425633576145 |
9 | 43266837477875 |
10 | 11101122002021 |
11 | 359aa60a67807 |
12 | 12b357b369a05 |
13 | 626aa6518bcc |
14 | 2a5423621349 |
15 | 143b74173deb |
hex | a18ae6efc65 |
11101122002021 has 8 divisors (see below), whose sum is σ = 11221805688000. Its totient is φ = 10980832064832.
The previous prime is 11101122002011. The next prime is 11101122002077. The reversal of 11101122002021 is 12020022110111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11101122002021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11101122001987 and 11101122002005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11101122002011) 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, 98380505 + ... + 98493278.
It is an arithmetic number, because the mean of its divisors is an integer number (1402725711000).
Almost surely, 211101122002021 is an apocalyptic number.
It is an amenable number.
11101122002021 is a deficient number, since it is larger than the sum of its proper divisors (120683685979).
11101122002021 is a wasteful number, since it uses less digits than its factorization.
11101122002021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 196874395.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11101122002021 its reverse (12020022110111), we get a palindrome (23121144112132).
The spelling of 11101122002021 in words is "eleven trillion, one hundred one billion, one hundred twenty-two million, two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •