Base | Representation |
---|---|
bin | 1011101101001010011… |
… | …1010000010001000101 |
3 | 201020002010220010222110 |
4 | 2323102213100101011 |
5 | 11243324103014341 |
6 | 232215053451233 |
7 | 20346331543362 |
oct | 2732247202105 |
9 | 636063803873 |
10 | 201102001221 |
11 | 78317923010 |
12 | 32b847a0b19 |
13 | 15c6b7209c4 |
14 | 9a3a5c1469 |
15 | 53700a3216 |
hex | 2ed29d0445 |
201102001221 has 8 divisors (see below), whose sum is σ = 292512001824. Its totient is φ = 121880000720.
The previous prime is 201102001181. The next prime is 201102001231. The reversal of 201102001221 is 122100201102.
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 201102001221 - 211 = 201101999173 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201102001197 and 201102001206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201102001231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3046999986 + ... + 3047000051.
It is an arithmetic number, because the mean of its divisors is an integer number (36564000228).
Almost surely, 2201102001221 is an apocalyptic number.
It is an amenable number.
201102001221 is a deficient number, since it is larger than the sum of its proper divisors (91410000603).
201102001221 is a wasteful number, since it uses less digits than its factorization.
201102001221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6094000051.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 201102001221 its reverse (122100201102), we get a palindrome (323202202323).
The spelling of 201102001221 in words is "two hundred one billion, one hundred two million, one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.301 sec. • engine limits •