Base | Representation |
---|---|
bin | 11000010010100… |
… | …11000010011100 |
3 | 112012102021110221 |
4 | 30021103002130 |
5 | 404130420433 |
6 | 32115211124 |
7 | 5022651520 |
oct | 1411230234 |
9 | 465367427 |
10 | 203763868 |
11 | a50238a0 |
12 | 582a6aa4 |
13 | 332a4549 |
14 | 1d0c1d80 |
15 | 12d4e72d |
hex | c25309c |
203763868 has 48 divisors (see below), whose sum is σ = 458938368. Its totient is φ = 76824000.
The previous prime is 203763841. The next prime is 203763871. The reversal of 203763868 is 868367302.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1123 + ... + 20218.
It is an arithmetic number, because the mean of its divisors is an integer number (9561216).
Almost surely, 2203763868 is an apocalyptic number.
203763868 is a gapful number since it is divisible by the number (28) 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 203763868, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (229469184).
203763868 is an abundant number, since it is smaller than the sum of its proper divisors (255174500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
203763868 is a wasteful number, since it uses less digits than its factorization.
203763868 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21394 (or 21392 counting only the distinct ones).
The product of its (nonzero) digits is 290304, while the sum is 43.
The square root of 203763868 is about 14274.5881902071. The cubic root of 203763868 is about 588.4493110435.
The spelling of 203763868 in words is "two hundred three million, seven hundred sixty-three thousand, eight hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •