Base | Representation |
---|---|
bin | 10100110001000101… |
… | …11010100001101111 |
3 | 1001210000020021010222 |
4 | 22120202322201233 |
5 | 140313200132142 |
6 | 5042154321555 |
7 | 543200561243 |
oct | 123042724157 |
9 | 31700207128 |
10 | 11149224047 |
11 | 48014a0055 |
12 | 21b1a292bb |
13 | 1088b142c0 |
14 | 77aa36423 |
15 | 453c18bd2 |
hex | 2988ba86f |
11149224047 has 8 divisors (see below), whose sum is σ = 12057097920. Its totient is φ = 10248527520.
The previous prime is 11149224007. The next prime is 11149224067. The reversal of 11149224047 is 74042294111.
11149224047 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 11149224047 - 26 = 11149223983 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11149223998 and 11149224016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11149224007) 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 7 ways as a sum of consecutive naturals, for example, 1791104 + ... + 1797317.
It is an arithmetic number, because the mean of its divisors is an integer number (1507137240).
Almost surely, 211149224047 is an apocalyptic number.
11149224047 is a deficient number, since it is larger than the sum of its proper divisors (907873873).
11149224047 is a wasteful number, since it uses less digits than its factorization.
11149224047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3588673.
The product of its (nonzero) digits is 16128, while the sum is 35.
The spelling of 11149224047 in words is "eleven billion, one hundred forty-nine million, two hundred twenty-four thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •