Base | Representation |
---|---|
bin | 11000000100011… |
… | …00111110100000 |
3 | 112001220210021010 |
4 | 30002030332200 |
5 | 403141412112 |
6 | 32011300520 |
7 | 5001104331 |
oct | 1402147640 |
9 | 461823233 |
10 | 201904032 |
11 | a3a73540 |
12 | 5774a740 |
13 | 32aa2b55 |
14 | 1cb5a288 |
15 | 12ad363c |
hex | c08cfa0 |
201904032 has 192 divisors, whose sum is σ = 631411200. Its totient is φ = 55802880.
The previous prime is 201904009. The next prime is 201904037. The reversal of 201904032 is 230409102.
It is not an unprimeable number, because it can be changed into a prime (201904037) by changing a digit.
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, 581683 + ... + 582029.
It is an arithmetic number, because the mean of its divisors is an integer number (3288600).
Almost surely, 2201904032 is an apocalyptic number.
201904032 is a gapful number since it is divisible by the number (22) 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 201904032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (315705600).
201904032 is an abundant number, since it is smaller than the sum of its proper divisors (429507168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201904032 is a wasteful number, since it uses less digits than its factorization.
201904032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 419 (or 411 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
The square root of 201904032 is about 14209.2938600059. The cubic root of 201904032 is about 586.6534971791.
The spelling of 201904032 in words is "two hundred one million, nine hundred four thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •