Base | Representation |
---|---|
bin | 10110111101101111101011… |
… | …110000000110010111110011 |
3 | 111020121111221102000112012211 |
4 | 112331233223300012113303 |
5 | 101214241211433021321 |
6 | 554450451025032551 |
7 | 30163005624224410 |
oct | 2675575360062763 |
9 | 436544842015184 |
10 | 101000111220211 |
11 | 2a1aa9a77974a5 |
12 | b3b25b8a85757 |
13 | 4448367483358 |
14 | 1ad2607d2b107 |
15 | ba23a0ba50e1 |
hex | 5bdbebc065f3 |
101000111220211 has 16 divisors (see below), whose sum is σ = 116891686912000. Its totient is φ = 85474317603168.
The previous prime is 101000111220121. The next prime is 101000111220221. The reversal of 101000111220211 is 112022111000101.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 101000111220211 - 219 = 101000110695923 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101000111220191 and 101000111220200.
It is not an unprimeable number, because it can be changed into a prime (101000111220221) 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 15 ways as a sum of consecutive naturals, for example, 34001365 + ... + 36852313.
It is an arithmetic number, because the mean of its divisors is an integer number (7305730432000).
Almost surely, 2101000111220211 is an apocalyptic number.
101000111220211 is a deficient number, since it is larger than the sum of its proper divisors (15891575691789).
101000111220211 is an equidigital number, since it uses as much as digits as its factorization.
101000111220211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2915098.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 101000111220211 its reverse (112022111000101), we get a palindrome (213022222220312).
The spelling of 101000111220211 in words is "one hundred one trillion, one hundred eleven million, two hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •