Base | Representation |
---|---|
bin | 101101011110100001110101… |
… | …000100010111101100000010 |
3 | 222020011202202212111121001100 |
4 | 231132201311010113230002 |
5 | 202203430440241320002 |
6 | 1545215154232115230 |
7 | 60062150165403003 |
oct | 5536416504275402 |
9 | 866152685447040 |
10 | 200010001120002 |
11 | 58802846422887 |
12 | 1a523340835b16 |
13 | 877ab2927c078 |
14 | 375676dd991aa |
15 | 181cabc0be11c |
hex | b5e875117b02 |
200010001120002 has 48 divisors (see below), whose sum is σ = 445786310885760. Its totient is φ = 64763313332256.
The previous prime is 200010001119989. The next prime is 200010001120021. The reversal of 200010001120002 is 200021100010002.
It is a super-3 number, since 3×2000100011200023 (a number of 44 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
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 23 ways as a sum of consecutive naturals, for example, 242168778 + ... + 242993285.
It is an arithmetic number, because the mean of its divisors is an integer number (9287214810120).
Almost surely, 2200010001120002 is an apocalyptic number.
200010001120002 is an abundant number, since it is smaller than the sum of its proper divisors (245776309765758).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200010001120002 is a wasteful number, since it uses less digits than its factorization.
200010001120002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 485162727 (or 485162724 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 200010001120002 its reverse (200021100010002), we get a palindrome (400031101130004).
The spelling of 200010001120002 in words is "two hundred trillion, ten billion, one million, one hundred twenty thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.429 sec. • engine limits •