Base | Representation |
---|---|
bin | 1011101101010001101… |
… | …1101110100110111000 |
3 | 201020011021100101100112 |
4 | 2323110123232212320 |
5 | 11243404412043300 |
6 | 232222104123452 |
7 | 20350152221663 |
oct | 2732433564670 |
9 | 636137311315 |
10 | 201132534200 |
11 | 78333087984 |
12 | 32b92a66588 |
13 | 15c74b51460 |
14 | 9a4068c6da |
15 | 5372ad4e35 |
hex | 2ed46ee9b8 |
201132534200 has 96 divisors (see below), whose sum is σ = 503948057760. Its totient is φ = 74213721600.
The previous prime is 201132534157. The next prime is 201132534263. The reversal of 201132534200 is 2435231102.
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, 3903002 + ... + 3954198.
It is an arithmetic number, because the mean of its divisors is an integer number (5249458935).
Almost surely, 2201132534200 is an apocalyptic number.
201132534200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 201132534200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (251974028880).
201132534200 is an abundant number, since it is smaller than the sum of its proper divisors (302815523560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201132534200 is a wasteful number, since it uses less digits than its factorization.
201132534200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52737 (or 52728 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 23.
Adding to 201132534200 its reverse (2435231102), we get a palindrome (203567765302).
The spelling of 201132534200 in words is "two hundred one billion, one hundred thirty-two million, five hundred thirty-four thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •