Base | Representation |
---|---|
bin | 1010001011111100000010… |
… | …0111000010100011011101 |
3 | 1110122201200222100110001020 |
4 | 2202333000213002203131 |
5 | 2432001013031401341 |
6 | 35453150032234353 |
7 | 2234121450253401 |
oct | 242770047024335 |
9 | 43581628313036 |
10 | 11200211200221 |
11 | 3628a8a262a4a |
12 | 130a81409b9b9 |
13 | 63323841c474 |
14 | 2aa143713101 |
15 | 14652344b566 |
hex | a2fc09c28dd |
11200211200221 has 8 divisors (see below), whose sum is σ = 15415344447744. Its totient is φ = 7225942709760.
The previous prime is 11200211200219. The next prime is 11200211200237. The reversal of 11200211200221 is 12200211200211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11200211200221 - 21 = 11200211200219 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11200211200221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11200211200121) 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, 60216189156 + ... + 60216189341.
It is an arithmetic number, because the mean of its divisors is an integer number (1926918055968).
Almost surely, 211200211200221 is an apocalyptic number.
It is an amenable number.
11200211200221 is a deficient number, since it is larger than the sum of its proper divisors (4215133247523).
11200211200221 is a wasteful number, since it uses less digits than its factorization.
11200211200221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120432378531.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 11200211200221 its reverse (12200211200211), we get a palindrome (23400422400432).
The spelling of 11200211200221 in words is "eleven trillion, two hundred billion, two hundred eleven million, two hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •