Base | Representation |
---|---|
bin | 10101001110010010… |
… | …00000111101010111 |
3 | 1002102001222220001021 |
4 | 22213021000331113 |
5 | 141313341433022 |
6 | 5122342542011 |
7 | 552233122462 |
oct | 124711007527 |
9 | 32361886037 |
10 | 11394092887 |
11 | 49177396a1 |
12 | 225ba37907 |
13 | 10c777b2c8 |
14 | 7a13782d9 |
15 | 46a4877c7 |
hex | 2a7240f57 |
11394092887 has 4 divisors (see below), whose sum is σ = 11397325120. Its totient is φ = 11390860656.
The previous prime is 11394092839. The next prime is 11394092911. The reversal of 11394092887 is 78829049311.
11394092887 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 78829049311 = 265567 ⋅296833.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11394092887 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11394092807) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1610823 + ... + 1617880.
It is an arithmetic number, because the mean of its divisors is an integer number (2849331280).
Almost surely, 211394092887 is an apocalyptic number.
11394092887 is a deficient number, since it is larger than the sum of its proper divisors (3232233).
11394092887 is an equidigital number, since it uses as much as digits as its factorization.
11394092887 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3232232.
The product of its (nonzero) digits is 870912, while the sum is 52.
The spelling of 11394092887 in words is "eleven billion, three hundred ninety-four million, ninety-two thousand, eight hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •