Base | Representation |
---|---|
bin | 101101011110100001110101… |
… | …000000100011110100001101 |
3 | 222020011202202210121211211000 |
4 | 231132201311000203310031 |
5 | 202203430440012333401 |
6 | 1545215154154450513 |
7 | 60062150154042522 |
oct | 5536416500436415 |
9 | 866152683554730 |
10 | 200010000121101 |
11 | 58802845900345 |
12 | 1a523340433a39 |
13 | 877ab28cbc4c1 |
14 | 375676dbb9149 |
15 | 181cabbe73186 |
hex | b5e875023d0d |
200010000121101 has 24 divisors (see below), whose sum is σ = 309754337533760. Its totient is φ = 127542608763768.
The previous prime is 200010000121091. The next prime is 200010000121157. The reversal of 200010000121101 is 101121000010002.
It is a happy number.
It is not a de Polignac number, because 200010000121101 - 29 = 200010000120589 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200010000121501) by changing a digit.
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, 7001666041 + ... + 7001694606.
Almost surely, 2200010000121101 is an apocalyptic number.
It is an amenable number.
200010000121101 is a deficient number, since it is larger than the sum of its proper divisors (109744337412659).
200010000121101 is a wasteful number, since it uses less digits than its factorization.
200010000121101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14003360702 (or 14003360673 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 200010000121101 its reverse (101121000010002), we get a palindrome (301131000131103).
The spelling of 200010000121101 in words is "two hundred trillion, ten billion, one hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •