Base | Representation |
---|---|
bin | 10110111111001101101111… |
… | …010001011000111101100011 |
3 | 111020222011121122000012211110 |
4 | 112333031233101120331203 |
5 | 101222420024103311321 |
6 | 555005112144114403 |
7 | 30203212361614452 |
oct | 2677155721307543 |
9 | 436864548005743 |
10 | 101101102010211 |
11 | 2a239811425806 |
12 | b40a0a2605a03 |
13 | 4454a40326b64 |
14 | 1ad74687bcb99 |
15 | ba4d11da2176 |
hex | 5bf36f458f63 |
101101102010211 has 32 divisors (see below), whose sum is σ = 138193885071360. Its totient is φ = 65715494189696.
The previous prime is 101101102010191. The next prime is 101101102010239. The reversal of 101101102010211 is 112010201101101.
It is a cyclic number.
It is not a de Polignac number, because 101101102010211 - 218 = 101101101748067 is a prime.
It is not an unprimeable number, because it can be changed into a prime (101101102010411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 439747690 + ... + 439977536.
It is an arithmetic number, because the mean of its divisors is an integer number (4318558908480).
Almost surely, 2101101102010211 is an apocalyptic number.
101101102010211 is a deficient number, since it is larger than the sum of its proper divisors (37092783061149).
101101102010211 is a wasteful number, since it uses less digits than its factorization.
101101102010211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 241763.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 101101102010211 its reverse (112010201101101), we get a palindrome (213111303111312).
The spelling of 101101102010211 in words is "one hundred one trillion, one hundred one billion, one hundred two million, ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •