Base | Representation |
---|---|
bin | 1010000000111111010011… |
… | …1110001111001101100001 |
3 | 1102222202011221220010000122 |
4 | 2200033310332033031201 |
5 | 2420410300422314320 |
6 | 35230521035130025 |
7 | 2214412244141450 |
oct | 240176476171541 |
9 | 42882157803018 |
10 | 11012111135585 |
11 | 356623471837a |
12 | 129a2798a3915 |
13 | 61b58c5caa81 |
14 | 2a0dbbc42b97 |
15 | 1416b4a7dd25 |
hex | a03f4f8f361 |
11012111135585 has 16 divisors (see below), whose sum is σ = 15103790155776. Its totient is φ = 7550428765248.
The previous prime is 11012111135567. The next prime is 11012111135587. The reversal of 11012111135585 is 58553111121011.
It is a cyclic number.
It is not a de Polignac number, because 11012111135585 - 222 = 11012106941281 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is not an unprimeable number, because it can be changed into a prime (11012111135587) 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, 14908334 + ... + 15629543.
It is an arithmetic number, because the mean of its divisors is an integer number (943986884736).
Almost surely, 211012111135585 is an apocalyptic number.
It is an amenable number.
11012111135585 is a deficient number, since it is larger than the sum of its proper divisors (4091679020191).
11012111135585 is a wasteful number, since it uses less digits than its factorization.
11012111135585 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30548192.
The product of its (nonzero) digits is 6000, while the sum is 35.
Adding to 11012111135585 its reverse (58553111121011), we get a palindrome (69565222256596).
The spelling of 11012111135585 in words is "eleven trillion, twelve billion, one hundred eleven million, one hundred thirty-five thousand, five hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •