Base | Representation |
---|---|
bin | 101101011111110110100101… |
… | …101111011001101110001111 |
3 | 222020111110200120120100102110 |
4 | 231133312211233121232033 |
5 | 202211423333034120421 |
6 | 1545325045203355103 |
7 | 60101551421316126 |
oct | 5537664557315617 |
9 | 866443616510373 |
10 | 200101012020111 |
11 | 588383a9732104 |
12 | 1a538b00082a93 |
13 | 87865a1656997 |
14 | 375ad25240abd |
15 | 1820147081a76 |
hex | b5fda5bd9b8f |
200101012020111 has 8 divisors (see below), whose sum is σ = 274012196640304. Its totient is φ = 129795251040000.
The previous prime is 200101012020073. The next prime is 200101012020137. The reversal of 200101012020111 is 111020210101002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200101012020111 - 29 = 200101012019599 is a prime.
It is a super-2 number, since 2×2001010120201112 (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 (200101012020211) 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, 901355909890 + ... + 901355910111.
It is an arithmetic number, because the mean of its divisors is an integer number (34251524580038).
Almost surely, 2200101012020111 is an apocalyptic number.
200101012020111 is a deficient number, since it is larger than the sum of its proper divisors (73911184620193).
200101012020111 is a wasteful number, since it uses less digits than its factorization.
200101012020111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1802711820041.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 200101012020111 its reverse (111020210101002), we get a palindrome (311121222121113).
The spelling of 200101012020111 in words is "two hundred trillion, one hundred one billion, twelve million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •