Base | Representation |
---|---|
bin | 10110111111010110000111… |
… | …101011000000010111110011 |
3 | 111021000000211210210011110120 |
4 | 112333112013223000113303 |
5 | 101223041441414004021 |
6 | 555013201142301323 |
7 | 30203651365463040 |
oct | 2677260753002763 |
9 | 437000753704416 |
10 | 101110101313011 |
11 | 2a24260a29013a |
12 | b40b994427843 |
13 | 44558458c19bb |
14 | 1ad7a7da921c7 |
15 | ba518be922c6 |
hex | 5bf587ac05f3 |
101110101313011 has 32 divisors (see below), whose sum is σ = 156928372185600. Its totient is φ = 56709317406720.
The previous prime is 101110101312973. The next prime is 101110101313063. The reversal of 101110101313011 is 110313101011101.
It is not a de Polignac number, because 101110101313011 - 26 = 101110101312947 is a prime.
It is a super-2 number, since 2×1011101013130112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (101110101353011) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 62861196 + ... + 64449593.
It is an arithmetic number, because the mean of its divisors is an integer number (4904011630800).
Almost surely, 2101110101313011 is an apocalyptic number.
101110101313011 is a deficient number, since it is larger than the sum of its proper divisors (55818270872589).
101110101313011 is a wasteful number, since it uses less digits than its factorization.
101110101313011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127311499.
The product of its (nonzero) digits is 9, while the sum is 15.
Adding to 101110101313011 its reverse (110313101011101), we get a palindrome (211423202324112).
The spelling of 101110101313011 in words is "one hundred one trillion, one hundred ten billion, one hundred one million, three hundred thirteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •