Base | Representation |
---|---|
bin | 11000010100011… |
… | …01111010111100 |
3 | 112012212112022200 |
4 | 30022031322330 |
5 | 404211130202 |
6 | 32124311500 |
7 | 5025004626 |
oct | 1412157274 |
9 | 465775280 |
10 | 204005052 |
11 | a5179019 |
12 | 583a2590 |
13 | 3335a264 |
14 | 1d145c16 |
15 | 12d9ae1c |
hex | c28debc |
204005052 has 72 divisors (see below), whose sum is σ = 548380560. Its totient is φ = 63763200.
The previous prime is 204004973. The next prime is 204005093. The reversal of 204005052 is 250500402.
It is a super-2 number, since 2×2040050522 = 83236122483045408, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 67608 + ... + 70560.
Almost surely, 2204005052 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 204005052, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (274190280).
204005052 is an abundant number, since it is smaller than the sum of its proper divisors (344375508).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
204005052 is a wasteful number, since it uses less digits than its factorization.
204005052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3083 (or 3078 counting only the distinct ones).
The product of its (nonzero) digits is 400, while the sum is 18.
The square root of 204005052 is about 14283.0337113654. The cubic root of 204005052 is about 588.6813911153.
Adding to 204005052 its reverse (250500402), we get a palindrome (454505454).
It can be divided in two parts, 20400 and 5052, that added together give a palindrome (25452).
The spelling of 204005052 in words is "two hundred four million, five thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •