Base | Representation |
---|---|
bin | 11000001110100… |
… | …11110111100100 |
3 | 112011102210221210 |
4 | 30013103313210 |
5 | 404012233410 |
6 | 32100111420 |
7 | 5015352063 |
oct | 1407236744 |
9 | 464383853 |
10 | 203242980 |
11 | a47a8506 |
12 | 58095570 |
13 | 33151425 |
14 | 1cdc81da |
15 | 12c9a220 |
hex | c1d3de4 |
203242980 has 48 divisors (see below), whose sum is σ = 572874624. Its totient is φ = 53836800.
The previous prime is 203242979. The next prime is 203242987. The reversal of 203242980 is 89242302.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is not an unprimeable number, because it can be changed into a prime (203242987) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2157 + ... + 20276.
It is an arithmetic number, because the mean of its divisors is an integer number (11934888).
Almost surely, 2203242980 is an apocalyptic number.
203242980 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 203242980, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (286437312).
203242980 is an abundant number, since it is smaller than the sum of its proper divisors (369631644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
203242980 is a wasteful number, since it uses less digits than its factorization.
203242980 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22596 (or 22594 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 30.
The square root of 203242980 is about 14256.3312251084. The cubic root of 203242980 is about 587.9474593250.
The spelling of 203242980 in words is "two hundred three million, two hundred forty-two thousand, nine hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •