Base | Representation |
---|---|
bin | 10110110010000110100111… |
… | …111110011001110101100011 |
3 | 111010210000222221222001210111 |
4 | 112302012213332121311203 |
5 | 101113134311202432321 |
6 | 553035143430512151 |
7 | 30051135065612425 |
oct | 2662064776316543 |
9 | 433700887861714 |
10 | 100200110202211 |
11 | 29a2169aaa7988 |
12 | b2a3552205657 |
13 | 43baaa323b516 |
14 | 1aa59d57bc815 |
15 | b8b67c7615e1 |
hex | 5b21a7f99d63 |
100200110202211 has 4 divisors (see below), whose sum is σ = 100200222669672. Its totient is φ = 100199997734752.
The previous prime is 100200110202187. The next prime is 100200110202229. The reversal of 100200110202211 is 112202011002001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 100200110202211 - 27 = 100200110202083 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100200110202191 and 100200110202200.
It is not an unprimeable number, because it can be changed into a prime (100200110203211) 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, 54886585 + ... + 56682778.
It is an arithmetic number, because the mean of its divisors is an integer number (25050055667418).
Almost surely, 2100200110202211 is an apocalyptic number.
100200110202211 is a deficient number, since it is larger than the sum of its proper divisors (112467461).
100200110202211 is an equidigital number, since it uses as much as digits as its factorization.
100200110202211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112467460.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 100200110202211 its reverse (112202011002001), we get a palindrome (212402121204212).
The spelling of 100200110202211 in words is "one hundred trillion, two hundred billion, one hundred ten million, two hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •