Base | Representation |
---|---|
bin | 1010100000100110100000… |
… | …0000100011011111110101 |
3 | 1111220200000020120200020110 |
4 | 2220021220000203133311 |
5 | 3003310030443031401 |
6 | 40324215552253233 |
7 | 2301556541632620 |
oct | 250115000433765 |
9 | 44820006520213 |
10 | 11555207002101 |
11 | 3755599122184 |
12 | 1367587541219 |
13 | 65a861009879 |
14 | 2bd3bc872db7 |
15 | 15089dd779d6 |
hex | a82680237f5 |
11555207002101 has 32 divisors (see below), whose sum is σ = 18176651993088. Its totient is φ = 6389723229120.
The previous prime is 11555207002081. The next prime is 11555207002123. The reversal of 11555207002101 is 10120070255511.
It is not a de Polignac number, because 11555207002101 - 25 = 11555207002069 is a prime.
It is a super-2 number, since 2×115552070021012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11555207002181) 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 31 ways as a sum of consecutive naturals, for example, 16742026 + ... + 17418548.
It is an arithmetic number, because the mean of its divisors is an integer number (568020374784).
Almost surely, 211555207002101 is an apocalyptic number.
It is an amenable number.
11555207002101 is a deficient number, since it is larger than the sum of its proper divisors (6621444990987).
11555207002101 is a wasteful number, since it uses less digits than its factorization.
11555207002101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 702801.
The product of its (nonzero) digits is 3500, while the sum is 30.
Adding to 11555207002101 its reverse (10120070255511), we get a palindrome (21675277257612).
The spelling of 11555207002101 in words is "eleven trillion, five hundred fifty-five billion, two hundred seven million, two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •