Base | Representation |
---|---|
bin | 101101101110011001000100… |
… | …100111110001101101000001 |
3 | 222101000222112102200222022002 |
4 | 231232121010213301231001 |
5 | 202324311011130324301 |
6 | 1551412040512553345 |
7 | 60234001124161442 |
oct | 5556310447615501 |
9 | 871028472628262 |
10 | 201100110011201 |
11 | 59093094483395 |
12 | 1a67a66bb52855 |
13 | 8829874aa462b |
14 | 37934239672c9 |
15 | 183b11e52116b |
hex | b6e6449f1b41 |
201100110011201 has 16 divisors (see below), whose sum is σ = 224137527485760. Its totient is φ = 179308130849280.
The previous prime is 201100110011191. The next prime is 201100110011261. The reversal of 201100110011201 is 102110011001102.
201100110011201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201100110011201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201100110011261) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 63727061 + ... + 66808221.
It is an arithmetic number, because the mean of its divisors is an integer number (14008595467860).
Almost surely, 2201100110011201 is an apocalyptic number.
It is an amenable number.
201100110011201 is a deficient number, since it is larger than the sum of its proper divisors (23037417474559).
201100110011201 is a wasteful number, since it uses less digits than its factorization.
201100110011201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3283264.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 201100110011201 its reverse (102110011001102), we get a palindrome (303210121012303).
The spelling of 201100110011201 in words is "two hundred one trillion, one hundred billion, one hundred ten million, eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •