Base | Representation |
---|---|
bin | 1010000011001101010101… |
… | …1001001010100001100101 |
3 | 1110010101120221121100220011 |
4 | 2200303111121022201211 |
5 | 2422021340410412104 |
6 | 35300224112010221 |
7 | 2220232102322341 |
oct | 240632531124145 |
9 | 43111527540804 |
10 | 11050236029029 |
11 | 358041918307a |
12 | 12a5739830971 |
13 | 622057054312 |
14 | 2a2b97386621 |
15 | 142696b23904 |
hex | a0cd564a865 |
11050236029029 has 2 divisors, whose sum is σ = 11050236029030. Its totient is φ = 11050236029028.
The previous prime is 11050236028963. The next prime is 11050236029099. The reversal of 11050236029029 is 92092063205011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7932193452225 + 3118042576804 = 2816415^2 + 1765798^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11050236029029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11050236028982 and 11050236029000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11050236029099) 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, 5525118014514 + 5525118014515.
It is an arithmetic number, because the mean of its divisors is an integer number (5525118014515).
Almost surely, 211050236029029 is an apocalyptic number.
It is an amenable number.
11050236029029 is a deficient number, since it is larger than the sum of its proper divisors (1).
11050236029029 is an equidigital number, since it uses as much as digits as its factorization.
11050236029029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 58320, while the sum is 40.
The spelling of 11050236029029 in words is "eleven trillion, fifty billion, two hundred thirty-six million, twenty-nine thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •