Base | Representation |
---|---|
bin | 10110111111001100111001… |
… | …100001010000100000010011 |
3 | 111020222002021210002112002002 |
4 | 112333030321201100200103 |
5 | 101222411202222401321 |
6 | 555004442451144215 |
7 | 30203151131430002 |
oct | 2677147141204023 |
9 | 436862253075062 |
10 | 101100200200211 |
11 | 2a239399377593 |
12 | b409a905a506b |
13 | 4454928548684 |
14 | 1ad73c0b10c39 |
15 | ba4cacb1920b |
hex | 5bf339850813 |
101100200200211 has 8 divisors (see below), whose sum is σ = 103700310634800. Its totient is φ = 98530500414240.
The previous prime is 101100200200177. The next prime is 101100200200271. The reversal of 101100200200211 is 112002002001101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101100200200211 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101100200200192 and 101100200200201.
It is not an unprimeable number, because it can be changed into a prime (101100200200271) 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, 7602655421 + ... + 7602668718.
It is an arithmetic number, because the mean of its divisors is an integer number (12962538829350).
Almost surely, 2101100200200211 is an apocalyptic number.
101100200200211 is a deficient number, since it is larger than the sum of its proper divisors (2600110434589).
101100200200211 is a wasteful number, since it uses less digits than its factorization.
101100200200211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15205324309.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 101100200200211 its reverse (112002002001101), we get a palindrome (213102202201312).
The spelling of 101100200200211 in words is "one hundred one trillion, one hundred billion, two hundred million, two hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •