Base | Representation |
---|---|
bin | 101110001011111011110000… |
… | …100111111111001001010000 |
3 | 222122020001121022101112200110 |
4 | 232023323300213333021100 |
5 | 203111041142344423440 |
6 | 2000004422430121320 |
7 | 60533450136046464 |
oct | 5613736047771120 |
9 | 878201538345613 |
10 | 203130220311120 |
11 | 597a6051854163 |
12 | 1a947bb7950240 |
13 | 894613650c7cb |
14 | 38237ab3744a4 |
15 | 1873d3ab64080 |
hex | b8bef09ff250 |
203130220311120 has 80 divisors (see below), whose sum is σ = 629706624857280. Its totient is φ = 54167805683712.
The previous prime is 203130220311059. The next prime is 203130220311131. The reversal of 203130220311120 is 21113022031302.
It is a tau number, because it is divible by the number of its divisors (80).
It is a congruent number.
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, 52637827 + ... + 56364893.
It is an arithmetic number, because the mean of its divisors is an integer number (7871332810716).
Almost surely, 2203130220311120 is an apocalyptic number.
203130220311120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
203130220311120 is an abundant number, since it is smaller than the sum of its proper divisors (426576404546160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
203130220311120 is a wasteful number, since it uses less digits than its factorization.
203130220311120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3954172 (or 3954166 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 203130220311120 its reverse (21113022031302), we get a palindrome (224243242342422).
The spelling of 203130220311120 in words is "two hundred three trillion, one hundred thirty billion, two hundred twenty million, three hundred eleven thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •