Base | Representation |
---|---|
bin | 10100101100010011… |
… | …01111001010101111 |
3 | 1001200012200012110001 |
4 | 22112021233022233 |
5 | 140222410210422 |
6 | 5034201525131 |
7 | 542202350455 |
oct | 122611571257 |
9 | 31605605401 |
10 | 11109069487 |
11 | 479086436a |
12 | 21a04a37a7 |
13 | 10806c52c9 |
14 | 7755829d5 |
15 | 450436227 |
hex | 29626f2af |
11109069487 has 4 divisors (see below), whose sum is σ = 11219060376. Its totient is φ = 10999078600.
The previous prime is 11109069481. The next prime is 11109069493. The reversal of 11109069487 is 78496090111.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (11109069481) and next prime (11109069493).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11109069487 is a prime.
It is a super-2 number, since 2×111090694872 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11109069481) 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 3 ways as a sum of consecutive naturals, for example, 54995293 + ... + 54995494.
It is an arithmetic number, because the mean of its divisors is an integer number (2804765094).
Almost surely, 211109069487 is an apocalyptic number.
11109069487 is a deficient number, since it is larger than the sum of its proper divisors (109990889).
11109069487 is a wasteful number, since it uses less digits than its factorization.
11109069487 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109990888.
The product of its (nonzero) digits is 108864, while the sum is 46.
The spelling of 11109069487 in words is "eleven billion, one hundred nine million, sixty-nine thousand, four hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •