Base | Representation |
---|---|
bin | 10111110110110… |
… | …01011100111000 |
3 | 111221120011012022 |
4 | 23323121130320 |
5 | 402212320440 |
6 | 31505134012 |
7 | 4646664404 |
oct | 1373313470 |
9 | 457504168 |
10 | 200120120 |
11 | a2a65232 |
12 | 5702a308 |
13 | 325c9b95 |
14 | 1c814104 |
15 | 1287ecb5 |
hex | bed9738 |
200120120 has 16 divisors (see below), whose sum is σ = 450270360. Its totient is φ = 80048032.
The previous prime is 200120069. The next prime is 200120131. The reversal of 200120120 is 21021002.
It is a Harshad number since it is a multiple of its sum of digits (8).
200120120 is a modest number, since divided by 120120 gives 200 as remainder.
It is a junction number, because it is equal to n+sod(n) for n = 200120098 and 200120107.
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 3 ways as a sum of consecutive naturals, for example, 2501462 + ... + 2501541.
Almost surely, 2200120120 is an apocalyptic number.
200120120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200120120 is an abundant number, since it is smaller than the sum of its proper divisors (250150240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200120120 is a wasteful number, since it uses less digits than its factorization.
200120120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5003014 (or 5003010 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 8.
The square root of 200120120 is about 14146.3818695806. The cubic root of 200120120 is about 584.9206018817.
Adding to 200120120 its reverse (21021002), we get a palindrome (221141122).
The spelling of 200120120 in words is "two hundred million, one hundred twenty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •