Base | Representation |
---|---|
bin | 1010001100100101000011… |
… | …0110110111010100011001 |
3 | 1110200210010021121111102100 |
4 | 2203021100312313110121 |
5 | 2432141040111432301 |
6 | 35502210334554013 |
7 | 2234661340604466 |
oct | 243112066672431 |
9 | 43623107544370 |
10 | 11211221202201 |
11 | 363271a102439 |
12 | 1310987368909 |
13 | 6342a1439537 |
14 | 2aa8a9a6866d |
15 | 146969d14286 |
hex | a3250db7519 |
11211221202201 has 6 divisors (see below), whose sum is σ = 16193986180970. Its totient is φ = 7474147468128.
The previous prime is 11211221202149. The next prime is 11211221202229. The reversal of 11211221202201 is 10220212211211.
11211221202201 is a `hidden beast` number, since 11 + 211 + 221 + 2 + 0 + 220 + 1 = 666.
It can be written as a sum of positive squares in only one way, i.e., 9204185145600 + 2007036056601 = 3033840^2 + 1416699^2 .
It is not a de Polignac number, because 11211221202201 - 214 = 11211221185817 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11211221202281) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 622845622336 + ... + 622845622353.
Almost surely, 211211221202201 is an apocalyptic number.
It is an amenable number.
11211221202201 is a deficient number, since it is larger than the sum of its proper divisors (4982764978769).
11211221202201 is a wasteful number, since it uses less digits than its factorization.
11211221202201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1245691244695 (or 1245691244692 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 11211221202201 its reverse (10220212211211), we get a palindrome (21431433413412).
The spelling of 11211221202201 in words is "eleven trillion, two hundred eleven billion, two hundred twenty-one million, two hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •