Base | Representation |
---|---|
bin | 101110001011111100101011… |
… | …000101100000111100111100 |
3 | 222122020011010122222022122202 |
4 | 232023330223011200330330 |
5 | 203111100144442132200 |
6 | 2000005104024331032 |
7 | 60533513345632562 |
oct | 5613745305407474 |
9 | 878204118868582 |
10 | 203131201130300 |
11 | 597a6505467123 |
12 | 1a948230313a78 |
13 | 89462617923a1 |
14 | 382386172ba32 |
15 | 1873d96d071d5 |
hex | b8bf2b160f3c |
203131201130300 has 72 divisors (see below), whose sum is σ = 458287372730880. Its totient is φ = 78065738769600.
The previous prime is 203131201130279. The next prime is 203131201130323. The reversal of 203131201130300 is 3031102131302.
It is a Harshad number since it is a multiple of its sum of digits (20).
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, 235274834 + ... + 236136633.
It is an arithmetic number, because the mean of its divisors is an integer number (6365102399040).
Almost surely, 2203131201130300 is an apocalyptic number.
203131201130300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
203131201130300 is an abundant number, since it is smaller than the sum of its proper divisors (255156171600580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
203131201130300 is a wasteful number, since it uses less digits than its factorization.
203131201130300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 471411651 (or 471411644 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 203131201130300 its reverse (3031102131302), we get a palindrome (206162303261602).
The spelling of 203131201130300 in words is "two hundred three trillion, one hundred thirty-one billion, two hundred one million, one hundred thirty thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •