Base | Representation |
---|---|
bin | 1010000011001101010110… |
… | …1001010110101110110101 |
3 | 1110010101121020120222222121 |
4 | 2200303111221112232311 |
5 | 2422021343002221313 |
6 | 35300224342555541 |
7 | 2220232153360402 |
oct | 240632551265665 |
9 | 43111536528877 |
10 | 11050240273333 |
11 | 3580420611968 |
12 | 12a573b138bb1 |
13 | 622057bac141 |
14 | 2a2b97b6d2a9 |
15 | 1426971b128d |
hex | a0cd5a56bb5 |
11050240273333 has 2 divisors, whose sum is σ = 11050240273334. Its totient is φ = 11050240273332.
The previous prime is 11050240273321. The next prime is 11050240273469. The reversal of 11050240273333 is 33337204205011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6869127293604 + 4181112979729 = 2620902^2 + 2044777^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11050240273333 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11050240273133) 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 as a sum of consecutive naturals, namely, 5525120136666 + 5525120136667.
It is an arithmetic number, because the mean of its divisors is an integer number (5525120136667).
Almost surely, 211050240273333 is an apocalyptic number.
It is an amenable number.
11050240273333 is a deficient number, since it is larger than the sum of its proper divisors (1).
11050240273333 is an equidigital number, since it uses as much as digits as its factorization.
11050240273333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 45360, while the sum is 34.
Adding to 11050240273333 its reverse (33337204205011), we get a palindrome (44387444478344).
The spelling of 11050240273333 in words is "eleven trillion, fifty billion, two hundred forty million, two hundred seventy-three thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •