Base | Representation |
---|---|
bin | 1011111011001010101101… |
… | …1000101001011101011100 |
3 | 1201102102002012000110010200 |
4 | 2332302223120221131130 |
5 | 3204303031040140404 |
6 | 43515055140303500 |
7 | 2522150444251656 |
oct | 276625330513534 |
9 | 51372065013120 |
10 | 13111115552604 |
11 | 41a5435a18003 |
12 | 15790320a1b90 |
13 | 7414b0320004 |
14 | 33481d4356d6 |
15 | 17b0b4688839 |
hex | becab62975c |
13111115552604 has 36 divisors (see below), whose sum is σ = 33142114771584. Its totient is φ = 4370354940672.
The previous prime is 13111115552597. The next prime is 13111115552609. The reversal of 13111115552604 is 40625551111131.
13111115552604 is a `hidden beast` number, since 1 + 3 + 1 + 11 + 115 + 5 + 526 + 0 + 4 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13111115552609) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 11739244 + ... + 12807500.
Almost surely, 213111115552604 is an apocalyptic number.
It is an amenable number.
13111115552604 is an abundant number, since it is smaller than the sum of its proper divisors (20030999218980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13111115552604 is a wasteful number, since it uses less digits than its factorization.
13111115552604 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1409194 (or 1409189 counting only the distinct ones).
The product of its (nonzero) digits is 18000, while the sum is 36.
Adding to 13111115552604 its reverse (40625551111131), we get a palindrome (53736666663735).
The spelling of 13111115552604 in words is "thirteen trillion, one hundred eleven billion, one hundred fifteen million, five hundred fifty-two thousand, six hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •