Base | Representation |
---|---|
bin | 10111111101001… |
… | …00101001111100 |
3 | 112000010102221010 |
4 | 23332210221330 |
5 | 402420434234 |
6 | 31535035220 |
7 | 4660032120 |
oct | 1376445174 |
9 | 460112833 |
10 | 200952444 |
11 | a3483600 |
12 | 5736bb10 |
13 | 3282b994 |
14 | 1c98d580 |
15 | 129966e9 |
hex | bfa4a7c |
200952444 has 144 divisors (see below), whose sum is σ = 624201984. Its totient is φ = 49082880.
The previous prime is 200952421. The next prime is 200952467. The reversal of 200952444 is 444259002.
It is an interprime number because it is at equal distance from previous prime (200952421) and next prime (200952467).
It is a congruent number.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 172207 + ... + 173369.
It is an arithmetic number, because the mean of its divisors is an integer number (4334736).
Almost surely, 2200952444 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 200952444, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (312100992).
200952444 is an abundant number, since it is smaller than the sum of its proper divisors (423249540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200952444 is a wasteful number, since it uses less digits than its factorization.
200952444 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1216 (or 1203 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 30.
The square root of 200952444 is about 14175.7696087373. The cubic root of 200952444 is about 585.7303989562.
The spelling of 200952444 in words is "two hundred million, nine hundred fifty-two thousand, four hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •