Base | Representation |
---|---|
bin | 11000001100110… |
… | …01110001111100 |
3 | 112010222201120122 |
4 | 30012121301330 |
5 | 403432130202 |
6 | 32051034112 |
7 | 5013341315 |
oct | 1406316174 |
9 | 463881518 |
10 | 203005052 |
11 | a4655778 |
12 | 57b9b938 |
13 | 3309a043 |
14 | 1cd6560c |
15 | 12c4e9a2 |
hex | c199c7c |
203005052 has 36 divisors (see below), whose sum is σ = 369011160. Its totient is φ = 97679712.
The previous prime is 203005039. The next prime is 203005091. The reversal of 203005052 is 250500302.
203005052 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2030050522 = 82422102275045408, which contains 22 as substring.
It is a zygodrome in base 2.
It is a self number, because there is not a number n which added to its sum of digits gives 203005052.
It is a congruent number.
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, 1460399 + ... + 1460537.
It is an arithmetic number, because the mean of its divisors is an integer number (10250310).
Almost surely, 2203005052 is an apocalyptic number.
It is an amenable number.
203005052 is a deficient number, since it is larger than the sum of its proper divisors (166006108).
203005052 is a wasteful number, since it uses less digits than its factorization.
203005052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 362 (or 277 counting only the distinct ones).
The product of its (nonzero) digits is 300, while the sum is 17.
The square root of 203005052 is about 14247.9841381158. The cubic root of 203005052 is about 587.7179412935.
Adding to 203005052 its reverse (250500302), we get a palindrome (453505354).
It can be divided in two parts, 20300 and 5052, that added together give a palindrome (25352).
The spelling of 203005052 in words is "two hundred three million, five thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •