Base | Representation |
---|---|
bin | 101110001011101010001001… |
… | …101010101111111110101000 |
3 | 222122011020210122011100210102 |
4 | 232023222021222233332220 |
5 | 203110233432124104000 |
6 | 1555552014335204532 |
7 | 60532210453366055 |
oct | 5613521152577650 |
9 | 878136718140712 |
10 | 203111313113000 |
11 | 5979902a173396 |
12 | 1a9443bb976748 |
13 | 8944412365406 |
14 | 38228d627602c |
15 | 18735d0d0b3d5 |
hex | b8ba89aaffa8 |
203111313113000 has 64 divisors (see below), whose sum is σ = 488125890954000. Its totient is φ = 79048727251200.
The previous prime is 203111313112993. The next prime is 203111313113053. The reversal of 203111313113000 is 311313111302.
It can be written as a sum of positive squares in 8 ways, for example, as 23459162893156 + 179652150219844 = 4843466^2 + 13403438^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2744710475 + ... + 2744784474.
Almost surely, 2203111313113000 is an apocalyptic number.
203111313113000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
203111313113000 is an abundant number, since it is smaller than the sum of its proper divisors (285014577841000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
203111313113000 is a wasteful number, since it uses less digits than its factorization.
203111313113000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5489495007 (or 5489494993 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 203111313113000 its reverse (311313111302), we get a palindrome (203422626224302).
The spelling of 203111313113000 in words is "two hundred three trillion, one hundred eleven billion, three hundred thirteen million, one hundred thirteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •