Base | Representation |
---|---|
bin | 101110001100111100111000… |
… | …001011101010000101011000 |
3 | 222122110202002011020001220011 |
4 | 232030330320023222011120 |
5 | 203113212341410233422 |
6 | 2000100504502411304 |
7 | 60541503622244224 |
oct | 5614747013520530 |
9 | 878422064201804 |
10 | 203200140321112 |
11 | 59822771881590 |
12 | 1a95966ba30b34 |
13 | 894c8ca1cb49c |
14 | 3826d214c7784 |
15 | 1875a7e224077 |
hex | b8cf382ea158 |
203200140321112 has 32 divisors (see below), whose sum is σ = 415641756629520. Its totient is φ = 92362565485440.
The previous prime is 203200140321109. The next prime is 203200140321121. The reversal of 203200140321112 is 211123041002302.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6958383 + ... + 21326494.
Almost surely, 2203200140321112 is an apocalyptic number.
203200140321112 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
203200140321112 is an abundant number, since it is smaller than the sum of its proper divisors (212441616308408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
203200140321112 is a wasteful number, since it uses less digits than its factorization.
203200140321112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28366531 (or 28366527 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 203200140321112 its reverse (211123041002302), we get a palindrome (414323181323414).
The spelling of 203200140321112 in words is "two hundred three trillion, two hundred billion, one hundred forty million, three hundred twenty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •