Base | Representation |
---|---|
bin | 11101011011010100100… |
… | …01001010110001001010 |
3 | 10120122211022102000021221 |
4 | 32231222101022301022 |
5 | 113031213122400020 |
6 | 2052254254152254 |
7 | 133023001616125 |
oct | 16555221126112 |
9 | 3518738360257 |
10 | 1011100200010 |
11 | 35a89478150a |
12 | 143b5b4b268a |
13 | 74466ba6a24 |
14 | 36d1a75b3bc |
15 | 1b47aee96aa |
hex | eb6a44ac4a |
1011100200010 has 16 divisors (see below), whose sum is σ = 1820115646056. Its totient is φ = 404410016448.
The previous prime is 1011100199971. The next prime is 1011100200017. The reversal of 1011100200010 is 100020011101.
It can be written as a sum of positive squares in 4 ways, for example, as 1009319613201 + 1780586809 = 1004649^2 + 42197^2 .
It is a super-2 number, since 2×10111002000102 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1011100199966 and 1011100200002.
It is not an unprimeable number, because it can be changed into a prime (1011100200017) 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 7 ways as a sum of consecutive naturals, for example, 3616437 + ... + 3885976.
Almost surely, 21011100200010 is an apocalyptic number.
1011100200010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1011100200010 is a deficient number, since it is larger than the sum of its proper divisors (809015446046).
1011100200010 is a wasteful number, since it uses less digits than its factorization.
1011100200010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7515897.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 1011100200010 its reverse (100020011101), we get a palindrome (1111120211111).
The spelling of 1011100200010 in words is "one trillion, eleven billion, one hundred million, two hundred thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •