Base | Representation |
---|---|
bin | 101101011110100010110111… |
… | …010010011111111100100110 |
3 | 222020011212122022001020200012 |
4 | 231132202313102133330212 |
5 | 202203440224200320402 |
6 | 1545215500400450222 |
7 | 60062216545632233 |
oct | 5536426722377446 |
9 | 866155568036605 |
10 | 200011112120102 |
11 | 58803266570688 |
12 | 1a5235b0919972 |
13 | 877ac754b188a |
14 | 375683775c78a |
15 | 181cb348c9452 |
hex | b5e8b749ff26 |
200011112120102 has 8 divisors (see below), whose sum is σ = 303387641980200. Its totient is φ = 98881898126704.
The previous prime is 200011112120089. The next prime is 200011112120107. The reversal of 200011112120102 is 201021211110002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×2000111121201022 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200011112120107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 561828966452 + ... + 561828966807.
It is an arithmetic number, because the mean of its divisors is an integer number (37923455247525).
Almost surely, 2200011112120102 is an apocalyptic number.
200011112120102 is a deficient number, since it is larger than the sum of its proper divisors (103376529860098).
200011112120102 is a wasteful number, since it uses less digits than its factorization.
200011112120102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1123657933350.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 200011112120102 its reverse (201021211110002), we get a palindrome (401032323230104).
The spelling of 200011112120102 in words is "two hundred trillion, eleven billion, one hundred twelve million, one hundred twenty thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •