Base | Representation |
---|---|
bin | 11000000010011… |
… | …11001000110100 |
3 | 112001102220210221 |
4 | 30001033020310 |
5 | 403110310430 |
6 | 32002024124 |
7 | 4666001014 |
oct | 1401171064 |
9 | 461386727 |
10 | 201650740 |
11 | a3910205 |
12 | 57648044 |
13 | 32a14785 |
14 | 1cad1c44 |
15 | 12a8357a |
hex | c04f234 |
201650740 has 48 divisors (see below), whose sum is σ = 436665600. Its totient is φ = 78164352.
The previous prime is 201650707. The next prime is 201650783. The reversal of 201650740 is 47056102.
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, 280101 + ... + 280819.
It is an arithmetic number, because the mean of its divisors is an integer number (9097200).
Almost surely, 2201650740 is an apocalyptic number.
201650740 is a gapful number since it is divisible by the number (20) 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 201650740, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (218332800).
201650740 is an abundant number, since it is smaller than the sum of its proper divisors (235014860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201650740 is a wasteful number, since it uses less digits than its factorization.
201650740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1144 (or 1142 counting only the distinct ones).
The product of its (nonzero) digits is 1680, while the sum is 25.
The square root of 201650740 is about 14200.3781639786. The cubic root of 201650740 is about 586.4080722981.
The spelling of 201650740 in words is "two hundred one million, six hundred fifty thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •