Base | Representation |
---|---|
bin | 11000010101101… |
… | …10100001000010 |
3 | 112020011222102010 |
4 | 30022312201002 |
5 | 404231440310 |
6 | 32132033350 |
7 | 5026266456 |
oct | 1412664102 |
9 | 466158363 |
10 | 204171330 |
11 | a5281a40 |
12 | 58462856 |
13 | 333b7b4c |
14 | 1d18a666 |
15 | 12dd0320 |
hex | c2b6842 |
204171330 has 64 divisors (see below), whose sum is σ = 536398848. Its totient is φ = 49325760.
The previous prime is 204171287. The next prime is 204171347. The reversal of 204171330 is 33171402.
204171330 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 204171297 and 204171306.
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 31 ways as a sum of consecutive naturals, for example, 113619 + ... + 115401.
It is an arithmetic number, because the mean of its divisors is an integer number (8381232).
Almost surely, 2204171330 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 204171330, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (268199424).
204171330 is an abundant number, since it is smaller than the sum of its proper divisors (332227518).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
204171330 is a wasteful number, since it uses less digits than its factorization.
204171330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2151.
The product of its (nonzero) digits is 504, while the sum is 21.
The square root of 204171330 is about 14288.8533479772. The cubic root of 204171330 is about 588.8412861459.
The spelling of 204171330 in words is "two hundred four million, one hundred seventy-one thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •