Base | Representation |
---|---|
bin | 1011101101111010011… |
… | …1001001100000111100 |
3 | 201020121011200012012120 |
4 | 2323132213021200330 |
5 | 11244232121101111 |
6 | 232251044202540 |
7 | 20354324550630 |
oct | 2733647114074 |
9 | 636534605176 |
10 | 201303300156 |
11 | 78410512972 |
12 | 33020099450 |
13 | 15ca13412ba |
14 | 9a59220dc0 |
15 | 5382ab7406 |
hex | 2ede9c983c |
201303300156 has 96 divisors (see below), whose sum is σ = 545003397120. Its totient is φ = 56637814464.
The previous prime is 201303300101. The next prime is 201303300157. The reversal of 201303300156 is 651003303102.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201303300157) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 31733121 + ... + 31739463.
It is an arithmetic number, because the mean of its divisors is an integer number (5677118720).
Almost surely, 2201303300156 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 201303300156, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (272501698560).
201303300156 is an abundant number, since it is smaller than the sum of its proper divisors (343700096964).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201303300156 is a wasteful number, since it uses less digits than its factorization.
201303300156 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12063 (or 12061 counting only the distinct ones).
The product of its (nonzero) digits is 1620, while the sum is 24.
Adding to 201303300156 its reverse (651003303102), we get a palindrome (852306603258).
The spelling of 201303300156 in words is "two hundred one billion, three hundred three million, three hundred thousand, one hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •