Base | Representation |
---|---|
bin | 10110111111011000111011… |
… | …000111111110101110011111 |
3 | 111021000022121121222102220022 |
4 | 112333120323013332232133 |
5 | 101223114123134430421 |
6 | 555014420012342355 |
7 | 30204116114242646 |
oct | 2677307307765637 |
9 | 437008547872808 |
10 | 101113112030111 |
11 | 2a243914800495 |
12 | b4104947749bb |
13 | 4455c055892cc |
14 | 1ad7c8788835d |
15 | ba52b64517ab |
hex | 5bf63b1feb9f |
101113112030111 has 2 divisors, whose sum is σ = 101113112030112. Its totient is φ = 101113112030110.
The previous prime is 101113112030087. The next prime is 101113112030221. The reversal of 101113112030111 is 111030211311101.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 101113112030111 - 238 = 100838234123167 is a prime.
It is a super-2 number, since 2×1011131120301112 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 101113112030111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101113112033111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50556556015055 + 50556556015056.
It is an arithmetic number, because the mean of its divisors is an integer number (50556556015056).
Almost surely, 2101113112030111 is an apocalyptic number.
101113112030111 is a deficient number, since it is larger than the sum of its proper divisors (1).
101113112030111 is an equidigital number, since it uses as much as digits as its factorization.
101113112030111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 17.
Adding to 101113112030111 its reverse (111030211311101), we get a palindrome (212143323341212).
The spelling of 101113112030111 in words is "one hundred one trillion, one hundred thirteen billion, one hundred twelve million, thirty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •