Base | Representation |
---|---|
bin | 10100101110001001… |
… | …00110101111011101 |
3 | 1001201021201020010221 |
4 | 22113010212233131 |
5 | 140240333021334 |
6 | 5035512401341 |
7 | 542450462614 |
oct | 122704465735 |
9 | 31637636127 |
10 | 11124501469 |
11 | 4799544674 |
12 | 21a56a6251 |
13 | 1083969463 |
14 | 77763c87b |
15 | 4519838b4 |
hex | 297126bdd |
11124501469 has 2 divisors, whose sum is σ = 11124501470. Its totient is φ = 11124501468.
The previous prime is 11124501407. The next prime is 11124501503. The reversal of 11124501469 is 96410542111.
It is an a-pointer prime, because the next prime (11124501503) can be obtained adding 11124501469 to its sum of digits (34).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5735032900 + 5389468569 = 75730^2 + 73413^2 .
It is a cyclic number.
It is not a de Polignac number, because 11124501469 - 29 = 11124500957 is a prime.
It is a super-2 number, since 2×111245014692 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11124531469) 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 as a sum of consecutive naturals, namely, 5562250734 + 5562250735.
It is an arithmetic number, because the mean of its divisors is an integer number (5562250735).
Almost surely, 211124501469 is an apocalyptic number.
It is an amenable number.
11124501469 is a deficient number, since it is larger than the sum of its proper divisors (1).
11124501469 is an equidigital number, since it uses as much as digits as its factorization.
11124501469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8640, while the sum is 34.
The spelling of 11124501469 in words is "eleven billion, one hundred twenty-four million, five hundred one thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •