Base | Representation |
---|---|
bin | 11101000110101001010… |
… | …01101100000110100011 |
3 | 10112121011201122001202120 |
4 | 32203110221230012203 |
5 | 112341000012023021 |
6 | 2043221012515323 |
7 | 132150635460456 |
oct | 16432451540643 |
9 | 3477151561676 |
10 | 1000000111011 |
11 | 356108aa1340 |
12 | 14198201bb43 |
13 | 733b8307225 |
14 | 3658647549d |
15 | 1b02b7892c6 |
hex | e8d4a6c1a3 |
1000000111011 has 16 divisors (see below), whose sum is σ = 1455085866240. Its totient is φ = 605835569120.
The previous prime is 1000000111003. The next prime is 1000000111013. The reversal of 1000000111011 is 1101110000001.
It is a cyclic number.
It is not a de Polignac number, because 1000000111011 - 23 = 1000000111003 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1000000111013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5537391 + ... + 5715128.
It is an arithmetic number, because the mean of its divisors is an integer number (90942866640).
Almost surely, 21000000111011 is an apocalyptic number.
1000000111011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1000000111011 is a deficient number, since it is larger than the sum of its proper divisors (455085755229).
1000000111011 is a wasteful number, since it uses less digits than its factorization.
1000000111011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11255226.
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 1000000111011 its reverse (1101110000001), we get a palindrome (2101110111012).
It can be divided in two parts, 10000001 and 11011, that multiplied together give a palindrome (110110011011).
The spelling of 1000000111011 in words is "one trillion, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •