Base | Representation |
---|---|
bin | 101101100001010010111000… |
… | …100000000011100100000101 |
3 | 222020211221110221210202001010 |
4 | 231201102320200003210011 |
5 | 202220034311404341401 |
6 | 1545442354502552433 |
7 | 60111660245000124 |
oct | 5541227040034405 |
9 | 866757427722033 |
10 | 200200111012101 |
11 | 58876432507592 |
12 | 1a554158138719 |
13 | 8792a355a8c95 |
14 | 3761a46761abb |
15 | 18229e7140ed6 |
hex | b614b8803905 |
200200111012101 has 4 divisors (see below), whose sum is σ = 266933481349472. Its totient is φ = 133466740674732.
The previous prime is 200200111012093. The next prime is 200200111012117. The reversal of 200200111012101 is 101210111002002.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 200200111012101 - 23 = 200200111012093 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200200111012501) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 33366685168681 + ... + 33366685168686.
It is an arithmetic number, because the mean of its divisors is an integer number (66733370337368).
Almost surely, 2200200111012101 is an apocalyptic number.
It is an amenable number.
200200111012101 is a deficient number, since it is larger than the sum of its proper divisors (66733370337371).
200200111012101 is an equidigital number, since it uses as much as digits as its factorization.
200200111012101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 66733370337370.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 200200111012101 its reverse (101210111002002), we get a palindrome (301410222014103).
The spelling of 200200111012101 in words is "two hundred trillion, two hundred billion, one hundred eleven million, twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •