Base | Representation |
---|---|
bin | 10100100100010100… |
… | …11110000000010101 |
3 | 1001111112202110112222 |
4 | 22102022132000111 |
5 | 140103242334334 |
6 | 5023411352125 |
7 | 540430514225 |
oct | 122212360025 |
9 | 31445673488 |
10 | 11042152469 |
11 | 4757009647 |
12 | 2181bb2645 |
13 | 106c895b3a |
14 | 76a724085 |
15 | 449618d2e |
hex | 29229e015 |
11042152469 has 2 divisors, whose sum is σ = 11042152470. Its totient is φ = 11042152468.
The previous prime is 11042152369. The next prime is 11042152559. The reversal of 11042152469 is 96425124011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10976752900 + 65399569 = 104770^2 + 8087^2 .
It is a cyclic number.
It is not a de Polignac number, because 11042152469 - 28 = 11042152213 is a prime.
It is a super-2 number, since 2×110421524692 (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 (11042152169) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5521076234 + 5521076235.
It is an arithmetic number, because the mean of its divisors is an integer number (5521076235).
Almost surely, 211042152469 is an apocalyptic number.
It is an amenable number.
11042152469 is a deficient number, since it is larger than the sum of its proper divisors (1).
11042152469 is an equidigital number, since it uses as much as digits as its factorization.
11042152469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17280, while the sum is 35.
The spelling of 11042152469 in words is "eleven billion, forty-two million, one hundred fifty-two thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •