Base | Representation |
---|---|
bin | 1010000001100010000010… |
… | …1111100100111100010101 |
3 | 1110000122020210012001211202 |
4 | 2200120200233210330111 |
5 | 2421033344432041113 |
6 | 35235102203042245 |
7 | 2215162305243362 |
oct | 240304057447425 |
9 | 43018223161752 |
10 | 11021435424533 |
11 | 356a189a726a6 |
12 | 12a0040510385 |
13 | 61c417301501 |
14 | 2a1624351469 |
15 | 141a5d466258 |
hex | a0620be4f15 |
11021435424533 has 2 divisors, whose sum is σ = 11021435424534. Its totient is φ = 11021435424532.
The previous prime is 11021435424463. The next prime is 11021435424583. The reversal of 11021435424533 is 33542453412011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7143127511569 + 3878307912964 = 2672663^2 + 1969342^2 .
It is a cyclic number.
It is not a de Polignac number, because 11021435424533 - 226 = 11021368315669 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11021435424583) 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, 5510717712266 + 5510717712267.
It is an arithmetic number, because the mean of its divisors is an integer number (5510717712267).
Almost surely, 211021435424533 is an apocalyptic number.
It is an amenable number.
11021435424533 is a deficient number, since it is larger than the sum of its proper divisors (1).
11021435424533 is an equidigital number, since it uses as much as digits as its factorization.
11021435424533 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 172800, while the sum is 38.
Adding to 11021435424533 its reverse (33542453412011), we get a palindrome (44563888836544).
The spelling of 11021435424533 in words is "eleven trillion, twenty-one billion, four hundred thirty-five million, four hundred twenty-four thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •