Base | Representation |
---|---|
bin | 1011101101001111100… |
… | …0100010101011011100 |
3 | 201020010121222202112121 |
4 | 2323103320202223130 |
5 | 11243400031412200 |
6 | 232221134312324 |
7 | 20350010634103 |
oct | 2732370425334 |
9 | 636117882477 |
10 | 201123310300 |
11 | 78328957920 |
12 | 32b8b9586a4 |
13 | 15c72c71c23 |
14 | 9a3d36b03a |
15 | 5371db1e1a |
hex | 2ed3e22adc |
201123310300 has 72 divisors (see below), whose sum is σ = 477134461440. Its totient is φ = 72978955200.
The previous prime is 201123310261. The next prime is 201123310379. The reversal of 201123310300 is 3013321102.
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, 317941 + ... + 709459.
It is an arithmetic number, because the mean of its divisors is an integer number (6626867520).
Almost surely, 2201123310300 is an apocalyptic number.
201123310300 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 201123310300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (238567230720).
201123310300 is an abundant number, since it is smaller than the sum of its proper divisors (276011151140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201123310300 is a wasteful number, since it uses less digits than its factorization.
201123310300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 392011 (or 392004 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 201123310300 its reverse (3013321102), we get a palindrome (204136631402).
The spelling of 201123310300 in words is "two hundred one billion, one hundred twenty-three million, three hundred ten thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •