Base | Representation |
---|---|
bin | 101101011110101011010000… |
… | …001100111000000101011100 |
3 | 222020012201220001222112002201 |
4 | 231132223100030320011130 |
5 | 202204112201210323400 |
6 | 1545223550303101244 |
7 | 60062656015510144 |
oct | 5536532014700534 |
9 | 866181801875081 |
10 | 200020120011100 |
11 | 588070692614a4 |
12 | 1a5252a55a1824 |
13 | 877ba7c7957ac |
14 | 375704dc29924 |
15 | 181ceb061406a |
hex | b5ead033815c |
200020120011100 has 18 divisors (see below), whose sum is σ = 434043660424304. Its totient is φ = 80008048004400.
The previous prime is 200020120011097. The next prime is 200020120011137. The reversal of 200020120011100 is 1110021020002.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1000100599956 + ... + 1000100600155.
Almost surely, 2200020120011100 is an apocalyptic number.
200020120011100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200020120011100 is an abundant number, since it is smaller than the sum of its proper divisors (234023540413204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200020120011100 is a wasteful number, since it uses less digits than its factorization.
200020120011100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2000201200125 (or 2000201200118 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 200020120011100 its reverse (1110021020002), we get a palindrome (201130141031102).
The spelling of 200020120011100 in words is "two hundred trillion, twenty billion, one hundred twenty million, eleven thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •