Base | Representation |
---|---|
bin | 1010001011111110111110… |
… | …1000111010110101000101 |
3 | 1110122210201222000220110212 |
4 | 2202333233220322311011 |
5 | 2432004122024101041 |
6 | 35453400215525205 |
7 | 2234150140654451 |
oct | 242775750726505 |
9 | 43583658026425 |
10 | 11201000222021 |
11 | 3629354685785 |
12 | 130a9b4389805 |
13 | 633332a2a47c |
14 | 2aa1ba421661 |
15 | 14656c8558eb |
hex | a2fefa3ad45 |
11201000222021 has 8 divisors (see below), whose sum is σ = 11316937794624. Its totient is φ = 11085072105600.
The previous prime is 11201000221993. The next prime is 11201000222029. The reversal of 11201000222021 is 12022200010211.
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-11201000222021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11201000221987 and 11201000222005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11201000222029) 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, 29726 + ... + 4733168.
It is an arithmetic number, because the mean of its divisors is an integer number (1414617224328).
Almost surely, 211201000222021 is an apocalyptic number.
It is an amenable number.
11201000222021 is a deficient number, since it is larger than the sum of its proper divisors (115937572603).
11201000222021 is an equidigital number, since it uses as much as digits as its factorization.
11201000222021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4728091.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 11201000222021 its reverse (12022200010211), we get a palindrome (23223200232232).
The spelling of 11201000222021 in words is "eleven trillion, two hundred one billion, two hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •