Base | Representation |
---|---|
bin | 1011101001000100000… |
… | …0000001111111111000 |
3 | 201010020102112122202022 |
4 | 2322101000001333320 |
5 | 11234100301400440 |
6 | 231513531454012 |
7 | 20310134102621 |
oct | 2722100017770 |
9 | 633212478668 |
10 | 200001200120 |
11 | 77902510937 |
12 | 32917bb7308 |
13 | 15b2464c4c7 |
14 | 9974314a48 |
15 | 530860ecb5 |
hex | 2e91001ff8 |
200001200120 has 16 divisors (see below), whose sum is σ = 450002700360. Its totient is φ = 80000480032.
The previous prime is 200001200071. The next prime is 200001200137. The reversal of 200001200120 is 21002100002.
It is a Harshad number since it is a multiple of its sum of digits (8).
200001200120 is a modest number, since divided by 1200120 gives 2000 as remainder.
It is a junction number, because it is equal to n+sod(n) for n = 200001200098 and 200001200107.
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, 2500014962 + ... + 2500015041.
Almost surely, 2200001200120 is an apocalyptic number.
200001200120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200001200120 is an abundant number, since it is smaller than the sum of its proper divisors (250001500240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200001200120 is a wasteful number, since it uses less digits than its factorization.
200001200120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5000030014 (or 5000030010 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 8.
Adding to 200001200120 its reverse (21002100002), we get a palindrome (221003300122).
The spelling of 200001200120 in words is "two hundred billion, one million, two hundred thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •