Base | Representation |
---|---|
bin | 10111110111101… |
… | …10101111110000 |
3 | 111221210020210110 |
4 | 23323312233300 |
5 | 402230140422 |
6 | 31511501320 |
7 | 4651004262 |
oct | 1373665760 |
9 | 457706713 |
10 | 200240112 |
11 | a30373a6 |
12 | 57087840 |
13 | 3263c697 |
14 | 1c845b32 |
15 | 128a560c |
hex | bef6bf0 |
200240112 has 40 divisors (see below), whose sum is σ = 517801680. Its totient is φ = 66680320.
The previous prime is 200240101. The next prime is 200240113. The reversal of 200240112 is 211042002.
It is a super-2 number, since 2×2002401122 = 80192204907545088, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200240113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 80812 + ... + 83252.
It is an arithmetic number, because the mean of its divisors is an integer number (12945042).
Almost surely, 2200240112 is an apocalyptic number.
It is an amenable number.
200240112 is an abundant number, since it is smaller than the sum of its proper divisors (317561568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200240112 is a wasteful number, since it uses less digits than its factorization.
200240112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4161 (or 4155 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
The square root of 200240112 is about 14150.6223184707. The cubic root of 200240112 is about 585.0374846315.
Adding to 200240112 its reverse (211042002), we get a palindrome (411282114).
The spelling of 200240112 in words is "two hundred million, two hundred forty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •