Base | Representation |
---|---|
bin | 10110111111010110111101… |
… | …111001100111000011000101 |
3 | 111021000010012012201200211102 |
4 | 112333112331321213003011 |
5 | 101223100322321023414 |
6 | 555013431322345445 |
7 | 30204013053600446 |
oct | 2677267571470305 |
9 | 437003165650742 |
10 | 101111011111109 |
11 | 2a242a368a499a |
12 | b40bba905b285 |
13 | 445595c23907c |
14 | 1ad7b2883d2cd |
15 | ba51e1ca6ede |
hex | 5bf5bde670c5 |
101111011111109 has 8 divisors (see below), whose sum is σ = 103263688973568. Its totient is φ = 98958390738480.
The previous prime is 101111011111093. The next prime is 101111011111129. The reversal of 101111011111109 is 901111110111101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101111011111109 - 24 = 101111011111093 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101111011111129) 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 7 ways as a sum of consecutive naturals, for example, 10808177 + ... + 17861654.
It is an arithmetic number, because the mean of its divisors is an integer number (12907961121696).
Almost surely, 2101111011111109 is an apocalyptic number.
It is an amenable number.
101111011111109 is a deficient number, since it is larger than the sum of its proper divisors (2152677862459).
101111011111109 is an equidigital number, since it uses as much as digits as its factorization.
101111011111109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28744915.
The product of its (nonzero) digits is 9, while the sum is 20.
The spelling of 101111011111109 in words is "one hundred one trillion, one hundred eleven billion, eleven million, one hundred eleven thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •