Base | Representation |
---|---|
bin | 10110111111010111000011… |
… | …010000100011010001000011 |
3 | 111021000010102110220002022102 |
4 | 112333113003100203101003 |
5 | 101223101013324323021 |
6 | 555013444253301015 |
7 | 30204015224665340 |
oct | 2677270320432103 |
9 | 437003373802272 |
10 | 101111101011011 |
11 | 2a242a82618033 |
12 | b41001319476b |
13 | 4455974a54590 |
14 | 1ad7b367617c7 |
15 | ba51e9b1400b |
hex | 5bf5c3423443 |
101111101011011 has 16 divisors (see below), whose sum is σ = 124461908507328. Its totient is φ = 79988757120000.
The previous prime is 101111101010939. The next prime is 101111101011029. The reversal of 101111101011011 is 110110101111101.
It is a cyclic number.
It is not a de Polignac number, because 101111101011011 - 246 = 30742356833347 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101111101010983 and 101111101011001.
It is not an unprimeable number, because it can be changed into a prime (101111101011911) 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 15 ways as a sum of consecutive naturals, for example, 77368490 + ... + 78664511.
It is an arithmetic number, because the mean of its divisors is an integer number (7778869281708).
Almost surely, 2101111101011011 is an apocalyptic number.
101111101011011 is a deficient number, since it is larger than the sum of its proper divisors (23350807496317).
101111101011011 is a wasteful number, since it uses less digits than its factorization.
101111101011011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156040142.
The product of its (nonzero) digits is 1, while the sum is 11.
Adding to 101111101011011 its reverse (110110101111101), we get a palindrome (211221202122112).
The spelling of 101111101011011 in words is "one hundred one trillion, one hundred eleven billion, one hundred one million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •