Base | Representation |
---|---|
bin | 101101101110101011101100… |
… | …001011011000111100000000 |
3 | 222101002220010122021222212110 |
4 | 231232223230023120330000 |
5 | 202330122431324324300 |
6 | 1551425144321255320 |
7 | 60235306406652330 |
oct | 5556535413307400 |
9 | 871086118258773 |
10 | 201120101011200 |
11 | 590a0612915598 |
12 | 1a68250aa94540 |
13 | 882b70c64a907 |
14 | 379439c9890c0 |
15 | 183b8de5b0550 |
hex | b6eaec2d8f00 |
201120101011200 has 216 divisors, whose sum is σ = 758557981487488. Its totient is φ = 45970308771840.
The previous prime is 201120101011199. The next prime is 201120101011211. The reversal of 201120101011200 is 2110101021102.
201120101011200 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 748080262 + ... + 748349061.
Almost surely, 2201120101011200 is an apocalyptic number.
201120101011200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201120101011200 is an abundant number, since it is smaller than the sum of its proper divisors (557437880476288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201120101011200 is a wasteful number, since it uses less digits than its factorization.
201120101011200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1496429359 (or 1496429340 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 201120101011200 its reverse (2110101021102), we get a palindrome (203230202032302).
The spelling of 201120101011200 in words is "two hundred one trillion, one hundred twenty billion, one hundred one million, eleven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •