Base | Representation |
---|---|
bin | 1010000110101101111000… |
… | …1110000000011111010111 |
3 | 1110100011011210120100021012 |
4 | 2201223132032000133113 |
5 | 2424013312443011211 |
6 | 35344033254242435 |
7 | 2224464612504551 |
oct | 241533616003727 |
9 | 43304153510235 |
10 | 11110513641431 |
11 | 35a3a40333476 |
12 | 12b536065641b |
13 | 6279421711a9 |
14 | 2a5a74a624d1 |
15 | 144023911d8b |
hex | a1ade3807d7 |
11110513641431 has 4 divisors (see below), whose sum is σ = 11593579451952. Its totient is φ = 10627447830912.
The previous prime is 11110513641413. The next prime is 11110513641467. The reversal of 11110513641431 is 13414631501111.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11110513641431 is a prime.
It is a super-2 number, since 2×111105136414312 (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 (11110513641631) 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 3 ways as a sum of consecutive naturals, for example, 241532905226 + ... + 241532905271.
It is an arithmetic number, because the mean of its divisors is an integer number (2898394862988).
Almost surely, 211110513641431 is an apocalyptic number.
11110513641431 is a deficient number, since it is larger than the sum of its proper divisors (483065810521).
11110513641431 is an equidigital number, since it uses as much as digits as its factorization.
11110513641431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 483065810520.
The product of its (nonzero) digits is 4320, while the sum is 32.
The spelling of 11110513641431 in words is "eleven trillion, one hundred ten billion, five hundred thirteen million, six hundred forty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •