Base | Representation |
---|---|
bin | 1011101101100010000… |
… | …1010111001111010011 |
3 | 201020100001101220200011 |
4 | 2323120201113033103 |
5 | 11244024441321321 |
6 | 232232554135351 |
7 | 20351644206130 |
oct | 2733041271723 |
9 | 636301356604 |
10 | 201201120211 |
11 | 78368872633 |
12 | 32bb1a21557 |
13 | 15c861164b0 |
14 | 9a49823587 |
15 | 5378b31ae1 |
hex | 2ed88573d3 |
201201120211 has 8 divisors (see below), whose sum is σ = 247632148064. Its totient is φ = 159192095040.
The previous prime is 201201120173. The next prime is 201201120251. The reversal of 201201120211 is 112021102102.
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 201201120211 - 27 = 201201120083 is a prime.
It is a super-2 number, since 2×2012011202112 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 201201120191 and 201201120200.
It is not an unprimeable number, because it can be changed into a prime (201201120251) 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, 1105500570 + ... + 1105500751.
It is an arithmetic number, because the mean of its divisors is an integer number (30954018508).
Almost surely, 2201201120211 is an apocalyptic number.
201201120211 is a deficient number, since it is larger than the sum of its proper divisors (46431027853).
201201120211 is a wasteful number, since it uses less digits than its factorization.
201201120211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2211001341.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 201201120211 its reverse (112021102102), we get a palindrome (313222222313).
The spelling of 201201120211 in words is "two hundred one billion, two hundred one million, one hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •