Base | Representation |
---|---|
bin | 101101011111110110100101… |
… | …001001001101110111111111 |
3 | 222020111110122212201210021201 |
4 | 231133312211021031313333 |
5 | 202211423323003310421 |
6 | 1545325044205040331 |
7 | 60101551240245346 |
oct | 5537664511156777 |
9 | 866443585653251 |
10 | 200101002010111 |
11 | 588383a4015484 |
12 | 1a538ab88560a7 |
13 | 878659c5606c7 |
14 | 375ad23b96b5d |
15 | 1820146255b91 |
hex | b5fda524ddff |
200101002010111 has 8 divisors (see below), whose sum is σ = 208814628267360. Its totient is φ = 191388507643872.
The previous prime is 200101002010093. The next prime is 200101002010127. The reversal of 200101002010111 is 111010200101002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 200101002010111 - 213 = 200101002001919 is a prime.
It is a super-2 number, since 2×2001010020101112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200101002010141) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 282611476 + ... + 283318633.
It is an arithmetic number, because the mean of its divisors is an integer number (26101828533420).
Almost surely, 2200101002010111 is an apocalyptic number.
200101002010111 is a deficient number, since it is larger than the sum of its proper divisors (8713626257249).
200101002010111 is a wasteful number, since it uses less digits than its factorization.
200101002010111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 565945505.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 200101002010111 its reverse (111010200101002), we get a palindrome (311111202111113).
The spelling of 200101002010111 in words is "two hundred trillion, one hundred one billion, two million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •