Base | Representation |
---|---|
bin | 10110111111010110001110… |
… | …110000001001010111111001 |
3 | 111021000001011002022020002220 |
4 | 112333112032300021113321 |
5 | 101223042212321213423 |
6 | 555013221024314253 |
7 | 30203654340246036 |
oct | 2677261660112771 |
9 | 437001132266086 |
10 | 101110220101113 |
11 | 2a242670344423 |
12 | b40ba08172989 |
13 | 44558643b3112 |
14 | 1ad7a9177438d |
15 | ba51976089e3 |
hex | 5bf58ec095f9 |
101110220101113 has 8 divisors (see below), whose sum is σ = 135497959933248. Its totient is φ = 67064646834864.
The previous prime is 101110220101087. The next prime is 101110220101127. The reversal of 101110220101113 is 311101022011101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101110220101113 - 210 = 101110220100089 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101110220101092 and 101110220101101.
It is not an unprimeable number, because it can be changed into a prime (101110220101193) 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, 85541640781 + ... + 85541641962.
It is an arithmetic number, because the mean of its divisors is an integer number (16937244991656).
Almost surely, 2101110220101113 is an apocalyptic number.
It is an amenable number.
101110220101113 is a deficient number, since it is larger than the sum of its proper divisors (34387739832135).
101110220101113 is a wasteful number, since it uses less digits than its factorization.
101110220101113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 171083282943.
The product of its (nonzero) digits is 12, while the sum is 15.
Adding to 101110220101113 its reverse (311101022011101), we get a palindrome (412211242112214).
The spelling of 101110220101113 in words is "one hundred one trillion, one hundred ten billion, two hundred twenty million, one hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •