Base | Representation |
---|---|
bin | 101101101100111011111100… |
… | …001010011011100111100000 |
3 | 222100200102102021020201020001 |
4 | 231230323330022123213200 |
5 | 202321141211142024300 |
6 | 1551254101552025344 |
7 | 60223531051100461 |
oct | 5554737412334740 |
9 | 870612367221201 |
10 | 201000110111200 |
11 | 59054739106434 |
12 | 1a663202232254 |
13 | 88202c92cb57a |
14 | 378c658930d68 |
15 | 183871a30616a |
hex | b6cefc29b9e0 |
201000110111200 has 36 divisors (see below), whose sum is σ = 490691518810920. Its totient is φ = 80400044044160.
The previous prime is 201000110111161. The next prime is 201000110111219. The reversal of 201000110111200 is 2111011000102.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 125625068020 + ... + 125625069619.
It is an arithmetic number, because the mean of its divisors is an integer number (13630319966970).
Almost surely, 2201000110111200 is an apocalyptic number.
201000110111200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201000110111200 is an abundant number, since it is smaller than the sum of its proper divisors (289691408699720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201000110111200 is a wasteful number, since it uses less digits than its factorization.
201000110111200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 251250137659 (or 251250137646 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 201000110111200 its reverse (2111011000102), we get a palindrome (203111121111302).
The spelling of 201000110111200 in words is "two hundred one trillion, one hundred ten million, one hundred eleven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •