Base | Representation |
---|---|
bin | 10111111111001… |
… | …10000111100010 |
3 | 112000122001202000 |
4 | 23333212013202 |
5 | 403003024303 |
6 | 31544504430 |
7 | 4662226626 |
oct | 1377460742 |
9 | 460561660 |
10 | 201220578 |
11 | a3646aa9 |
12 | 5747b116 |
13 | 328c3a40 |
14 | 1ca1d186 |
15 | 129eada3 |
hex | bfe61e2 |
201220578 has 128 divisors (see below), whose sum is σ = 506634240. Its totient is φ = 58786560.
The previous prime is 201220573. The next prime is 201220627. The reversal of 201220578 is 875022102.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (201220573) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1584351 + ... + 1584477.
It is an arithmetic number, because the mean of its divisors is an integer number (3958080).
Almost surely, 2201220578 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 201220578, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (253317120).
201220578 is an abundant number, since it is smaller than the sum of its proper divisors (305413662).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201220578 is a wasteful number, since it uses less digits than its factorization.
201220578 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 249 (or 243 counting only the distinct ones).
The product of its (nonzero) digits is 2240, while the sum is 27.
The square root of 201220578 is about 14185.2239319653. The cubic root of 201220578 is about 585.9907995931.
The spelling of 201220578 in words is "two hundred one million, two hundred twenty thousand, five hundred seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •