Base | Representation |
---|---|
bin | 11101011001010010101… |
… | …10100111111001100011 |
3 | 10120120000102002120001100 |
4 | 32230221112213321203 |
5 | 113022000321023021 |
6 | 2051554231205443 |
7 | 132654005535420 |
oct | 16545126477143 |
9 | 3516012076040 |
10 | 1010011111011 |
11 | 35a385a39861 |
12 | 1438b6816883 |
13 | 74322376476 |
14 | 36c55c5cd47 |
15 | 1b4155bb626 |
hex | eb295a7e63 |
1010011111011 has 96 divisors (see below), whose sum is σ = 1741104009216. Its totient is φ = 552075264000.
The previous prime is 1010011111003. The next prime is 1010011111037. The reversal of 1010011111011 is 1101111100101.
It is not a de Polignac number, because 1010011111011 - 23 = 1010011111003 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1010011110984 and 1010011111002.
It is not an unprimeable number, because it can be changed into a prime (1010011111511) 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 95 ways as a sum of consecutive naturals, for example, 65743971 + ... + 65759331.
It is an arithmetic number, because the mean of its divisors is an integer number (18136500096).
Almost surely, 21010011111011 is an apocalyptic number.
1010011111011 is a deficient number, since it is larger than the sum of its proper divisors (731092898205).
1010011111011 is a wasteful number, since it uses less digits than its factorization.
1010011111011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15793 (or 15790 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 1010011111011 its reverse (1101111100101), we get a palindrome (2111122211112).
The spelling of 1010011111011 in words is "one trillion, ten billion, eleven million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •