Base | Representation |
---|---|
bin | 1011110101011011010… |
… | …0101111111010000000 |
3 | 201102210201200211021122 |
4 | 2331112310233322000 |
5 | 11312344423144300 |
6 | 233223132011412 |
7 | 20455314412544 |
oct | 2752664577200 |
9 | 642721624248 |
10 | 203320131200 |
11 | 79255a0598a |
12 | 334a3600b68 |
13 | 1623312c554 |
14 | 9bab01ba24 |
15 | 544eba1c85 |
hex | 2f56d2fe80 |
203320131200 has 96 divisors (see below), whose sum is σ = 503386447500. Its totient is φ = 81146347520.
The previous prime is 203320131199. The next prime is 203320131229. The reversal of 203320131200 is 2131023302.
It can be written as a sum of positive squares in 6 ways, for example, as 92313884224 + 111006246976 = 303832^2 + 333176^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1366046 + ... + 1507554.
Almost surely, 2203320131200 is an apocalyptic number.
203320131200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 203320131200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (251693223750).
203320131200 is an abundant number, since it is smaller than the sum of its proper divisors (300066316300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
203320131200 is a wasteful number, since it uses less digits than its factorization.
203320131200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 141982 (or 141965 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 203320131200 its reverse (2131023302), we get a palindrome (205451154502).
The spelling of 203320131200 in words is "two hundred three billion, three hundred twenty million, one hundred thirty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •