Base | Representation |
---|---|
bin | 10110111111010110001000… |
… | …001100001001001110001011 |
3 | 111021000000212102010111210022 |
4 | 112333112020030021032023 |
5 | 101223042001130000021 |
6 | 555013202052411055 |
7 | 30203651532353420 |
oct | 2677261014111613 |
9 | 437000772114708 |
10 | 101110110000011 |
11 | 2a242614183882 |
12 | b40b997316a8b |
13 | 4455847643a38 |
14 | 1ad7a80cb3d47 |
15 | ba518cb0b1ab |
hex | 5bf58830938b |
101110110000011 has 8 divisors (see below), whose sum is σ = 118241723322624. Its totient is φ = 84650324650920.
The previous prime is 101110109999971. The next prime is 101110110000079. The reversal of 101110110000011 is 110000011011101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101110110000011 - 230 = 101109036258187 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101110110000091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 167956993055 + ... + 167956993656.
It is an arithmetic number, because the mean of its divisors is an integer number (14780215415328).
Almost surely, 2101110110000011 is an apocalyptic number.
101110110000011 is a deficient number, since it is larger than the sum of its proper divisors (17131613322613).
101110110000011 is an equidigital number, since it uses as much as digits as its factorization.
101110110000011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 335913986761.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 101110110000011 its reverse (110000011011101), we get a palindrome (211110121011112).
The spelling of 101110110000011 in words is "one hundred one trillion, one hundred ten billion, one hundred ten million, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •