Base | Representation |
---|---|
bin | 101101101110101011101100… |
… | …101101101101111101011001 |
3 | 222101002220011021020012011210 |
4 | 231232223230231231331121 |
5 | 202330122441130311301 |
6 | 1551425145242213333 |
7 | 60235306546312434 |
oct | 5556535455557531 |
9 | 871086137205153 |
10 | 201120110010201 |
11 | 590a0617a01688 |
12 | 1a682511ab4249 |
13 | 882b71147b975 |
14 | 379439dc4c81b |
15 | 183b8e028bad6 |
hex | b6eaecb6df59 |
201120110010201 has 8 divisors (see below), whose sum is σ = 268160217482304. Its totient is φ = 134080037939120.
The previous prime is 201120110010191. The next prime is 201120110010371. The reversal of 201120110010201 is 102010011021102.
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 201120110010201 - 27 = 201120110010073 is a prime.
It is not an unprimeable number, because it can be changed into a prime (201120110010101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10367011 + ... + 22576871.
It is an arithmetic number, because the mean of its divisors is an integer number (33520027185288).
Almost surely, 2201120110010201 is an apocalyptic number.
It is an amenable number.
201120110010201 is a deficient number, since it is larger than the sum of its proper divisors (67040107472103).
201120110010201 is a wasteful number, since it uses less digits than its factorization.
201120110010201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17700511.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 201120110010201 its reverse (102010011021102), we get a palindrome (303130121031303).
The spelling of 201120110010201 in words is "two hundred one trillion, one hundred twenty billion, one hundred ten million, ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •