Base | Representation |
---|---|
bin | 1010001000101111011110… |
… | …1011010110111000110001 |
3 | 1110110110222011012001202202 |
4 | 2202023313223112320301 |
5 | 2430101033412112423 |
6 | 35412025205352545 |
7 | 2230135636116356 |
oct | 242136753267061 |
9 | 43413864161682 |
10 | 11145300504113 |
11 | 3607771639266 |
12 | 130004a708755 |
13 | 62acc718acc9 |
14 | 2a7614b2a62d |
15 | 144dac8e0728 |
hex | a22f7ad6e31 |
11145300504113 has 8 divisors (see below), whose sum is σ = 11690067925632. Its totient is φ = 10613351139696.
The previous prime is 11145300504089. The next prime is 11145300504139. The reversal of 11145300504113 is 31140500354111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11145300504113 - 214 = 11145300487729 is a prime.
It is a super-3 number, since 3×111453005041133 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11145300501113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3204512495 + ... + 3204515972.
It is an arithmetic number, because the mean of its divisors is an integer number (1461258490704).
Almost surely, 211145300504113 is an apocalyptic number.
It is an amenable number.
11145300504113 is a deficient number, since it is larger than the sum of its proper divisors (544767421519).
11145300504113 is an equidigital number, since it uses as much as digits as its factorization.
11145300504113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6409028551.
The product of its (nonzero) digits is 3600, while the sum is 29.
Adding to 11145300504113 its reverse (31140500354111), we get a palindrome (42285800858224).
The spelling of 11145300504113 in words is "eleven trillion, one hundred forty-five billion, three hundred million, five hundred four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •