Base | Representation |
---|---|
bin | 1010000011001110010011… |
… | …0110111100100100100011 |
3 | 1110010102021000211120112000 |
4 | 2200303210312330210203 |
5 | 2422022403321310220 |
6 | 35300305541135043 |
7 | 2220241402616265 |
oct | 240634466744443 |
9 | 43112230746460 |
10 | 11050495494435 |
11 | 35805416912a1 |
12 | 12a57b06ba483 |
13 | 622098a2c147 |
14 | 2a2bbda07b35 |
15 | 1426ae7c7390 |
hex | a0ce4dbc923 |
11050495494435 has 64 divisors (see below), whose sum is σ = 20510437109760. Its totient is φ = 5634338244480.
The previous prime is 11050495494433. The next prime is 11050495494503. The reversal of 11050495494435 is 53449459405011.
11050495494435 is a `hidden beast` number, since 1 + 1 + 0 + 50 + 4 + 9 + 549 + 4 + 43 + 5 = 666.
It is not a de Polignac number, because 11050495494435 - 21 = 11050495494433 is a prime.
It is a super-2 number, since 2×110504954944352 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11050495494433) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 4858377 + ... + 6760533.
It is an arithmetic number, because the mean of its divisors is an integer number (320475579840).
Almost surely, 211050495494435 is an apocalyptic number.
11050495494435 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
11050495494435 is a deficient number, since it is larger than the sum of its proper divisors (9459941615325).
11050495494435 is a wasteful number, since it uses less digits than its factorization.
11050495494435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1904065 (or 1904059 counting only the distinct ones).
The product of its (nonzero) digits is 7776000, while the sum is 54.
The spelling of 11050495494435 in words is "eleven trillion, fifty billion, four hundred ninety-five million, four hundred ninety-four thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •