Base | Representation |
---|---|
bin | 1010001100000011011111… |
… | …0111100001100011100011 |
3 | 1110122220212102020010100221 |
4 | 2203000313313201203203 |
5 | 2432014112233311321 |
6 | 35454120344423511 |
7 | 2234222154000565 |
oct | 243006767414343 |
9 | 43586772203327 |
10 | 11202212010211 |
11 | 3629916703122 |
12 | 130b092177b97 |
13 | 633496abb3c1 |
14 | 2aa29333d335 |
15 | 1465dde1de41 |
hex | a3037de18e3 |
11202212010211 has 8 divisors (see below), whose sum is σ = 11481427989680. Its totient is φ = 10923846004512.
The previous prime is 11202212010161. The next prime is 11202212010217. The reversal of 11202212010211 is 11201021220211.
11202212010211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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-11202212010211 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11202212010217) 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, 212466756 + ... + 212519473.
It is an arithmetic number, because the mean of its divisors is an integer number (1435178498710).
Almost surely, 211202212010211 is an apocalyptic number.
11202212010211 is a deficient number, since it is larger than the sum of its proper divisors (279215979469).
11202212010211 is an equidigital number, since it uses as much as digits as its factorization.
11202212010211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 424986885.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 11202212010211 its reverse (11201021220211), we get a palindrome (22403233230422).
The spelling of 11202212010211 in words is "eleven trillion, two hundred two billion, two hundred twelve million, ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •