Base | Representation |
---|---|
bin | 10101011001101111… |
… | …01111011011101101 |
3 | 1002122202220001120010 |
4 | 22230313233123231 |
5 | 142012444243244 |
6 | 5140055243433 |
7 | 554511216564 |
oct | 125467573355 |
9 | 32582801503 |
10 | 11490227949 |
11 | 4966a30362 |
12 | 2288079579 |
13 | 111166a865 |
14 | 7b0040bdb |
15 | 473b26eb9 |
hex | 2acdef6ed |
11490227949 has 16 divisors (see below), whose sum is σ = 15438503808. Its totient is φ = 7601098752.
The previous prime is 11490227927. The next prime is 11490227999. The reversal of 11490227949 is 94972209411.
It is not a de Polignac number, because 11490227949 - 27 = 11490227821 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11490227898 and 11490227907.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11490227999) 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 15 ways as a sum of consecutive naturals, for example, 1416784 + ... + 1424870.
It is an arithmetic number, because the mean of its divisors is an integer number (964906488).
Almost surely, 211490227949 is an apocalyptic number.
It is an amenable number.
11490227949 is a deficient number, since it is larger than the sum of its proper divisors (3948275859).
11490227949 is a wasteful number, since it uses less digits than its factorization.
11490227949 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11684.
The product of its (nonzero) digits is 326592, while the sum is 48.
The spelling of 11490227949 in words is "eleven billion, four hundred ninety million, two hundred twenty-seven thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •