Base | Representation |
---|---|
bin | 101101101101010000011011… |
… | …100001100011010011111001 |
3 | 222100202112012112222212002121 |
4 | 231231100123201203103321 |
5 | 202322021240420232301 |
6 | 1551312141041401241 |
7 | 60225240211324414 |
oct | 5555203341432371 |
9 | 870675175885077 |
10 | 201022111102201 |
11 | 59062aa9099624 |
12 | 1a667522339221 |
13 | 88223c440963c |
14 | 378d74488cb7b |
15 | 18390a6a7d3a1 |
hex | b6d41b8634f9 |
201022111102201 has 4 divisors (see below), whose sum is σ = 201065406844752. Its totient is φ = 200978815359652.
The previous prime is 201022111102177. The next prime is 201022111102237. The reversal of 201022111102201 is 102201111220102.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 201022111102201 - 27 = 201022111102073 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201022111103201) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21647864311 + ... + 21647873596.
It is an arithmetic number, because the mean of its divisors is an integer number (50266351711188).
Almost surely, 2201022111102201 is an apocalyptic number.
It is an amenable number.
201022111102201 is a deficient number, since it is larger than the sum of its proper divisors (43295742551).
201022111102201 is an equidigital number, since it uses as much as digits as its factorization.
201022111102201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43295742550.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 201022111102201 its reverse (102201111220102), we get a palindrome (303223222322303).
The spelling of 201022111102201 in words is "two hundred one trillion, twenty-two billion, one hundred eleven million, one hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •