Base | Representation |
---|---|
bin | 1010001011111111000011… |
… | …0100010111111110100011 |
3 | 1110122210210100020211210111 |
4 | 2202333300310113332203 |
5 | 2432004142110032321 |
6 | 35453402203512151 |
7 | 2234150501046604 |
oct | 242776064277643 |
9 | 43583710224714 |
10 | 11201020002211 |
11 | 3629364865946 |
12 | 130a9bab28657 |
13 | 633336b64820 |
14 | 2aa1bcccddab |
15 | 14656e4615e1 |
hex | a2ff0d17fa3 |
11201020002211 has 8 divisors (see below), whose sum is σ = 12065257593200. Its totient is φ = 10337156792352.
The previous prime is 11201020002181. The next prime is 11201020002217. The reversal of 11201020002211 is 11220002010211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11201020002211 - 213 = 11201019994019 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11201020002191 and 11201020002200.
It is not an unprimeable number, because it can be changed into a prime (11201020002217) 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, 93533136 + ... + 93652813.
It is an arithmetic number, because the mean of its divisors is an integer number (1508157199150).
Almost surely, 211201020002211 is an apocalyptic number.
11201020002211 is a deficient number, since it is larger than the sum of its proper divisors (864237590989).
11201020002211 is a wasteful number, since it uses less digits than its factorization.
11201020002211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 187190565.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 11201020002211 its reverse (11220002010211), we get a palindrome (22421022012422).
The spelling of 11201020002211 in words is "eleven trillion, two hundred one billion, twenty million, two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •