Base | Representation |
---|---|
bin | 1010001011111110111111… |
… | …0000100000011110010101 |
3 | 1110122210202002202222010221 |
4 | 2202333233300200132111 |
5 | 2432004123031224341 |
6 | 35453400330314341 |
7 | 2234150163611044 |
oct | 242775760403625 |
9 | 43583662688127 |
10 | 11201002211221 |
11 | 3629355814249 |
12 | 130a9b4b889b1 |
13 | 633333275a04 |
14 | 2aa1ba7bc55b |
15 | 14656cae9ed1 |
hex | a2fefc20795 |
11201002211221 has 8 divisors (see below), whose sum is σ = 11869128586944. Its totient is φ = 10533902934720.
The previous prime is 11201002211213. The next prime is 11201002211233. The reversal of 11201002211221 is 12211220010211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11201002211221 - 23 = 11201002211213 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11201002211195 and 11201002211204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11201002211261) 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, 256752345 + ... + 256795966.
It is an arithmetic number, because the mean of its divisors is an integer number (1483641073368).
Almost surely, 211201002211221 is an apocalyptic number.
It is an amenable number.
11201002211221 is a deficient number, since it is larger than the sum of its proper divisors (668126375723).
11201002211221 is a wasteful number, since it uses less digits than its factorization.
11201002211221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 513549611.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 11201002211221 its reverse (12211220010211), we get a palindrome (23412222221432).
The spelling of 11201002211221 in words is "eleven trillion, two hundred one billion, two million, two hundred eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •