Base | Representation |
---|---|
bin | 11101011011010101101… |
… | …11010100001011001011 |
3 | 10120122212000020001201100 |
4 | 32231222313110023023 |
5 | 113031223202400021 |
6 | 2052255252352443 |
7 | 133023152615502 |
oct | 16555267241313 |
9 | 3518760201640 |
10 | 1011110200011 |
11 | 35a89a39167a |
12 | 143b62915723 |
13 | 74468c985a2 |
14 | 36d1bc01839 |
15 | 1b47bd22626 |
hex | eb6add42cb |
1011110200011 has 24 divisors (see below), whose sum is σ = 1504416384224. Its totient is φ = 653909034240.
The previous prime is 1011110200007. The next prime is 1011110200117. The reversal of 1011110200011 is 1100020111101.
It is not a de Polignac number, because 1011110200011 - 22 = 1011110200007 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1011110199966 and 1011110200002.
It is not an unprimeable number, because it can be changed into a prime (1011110200411) 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 23 ways as a sum of consecutive naturals, for example, 4392775 + ... + 4617216.
Almost surely, 21011110200011 is an apocalyptic number.
1011110200011 is a deficient number, since it is larger than the sum of its proper divisors (493306184213).
1011110200011 is a wasteful number, since it uses less digits than its factorization.
1011110200011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9010371 (or 9010368 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1011110200011 its reverse (1100020111101), we get a palindrome (2111130311112).
It can be divided in two parts, 1011110 and 200011, that added together give a palindrome (1211121).
The spelling of 1011110200011 in words is "one trillion, eleven billion, one hundred ten million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •