Base | Representation |
---|---|
bin | 10100100000100000… |
… | …00000100111100101 |
3 | 1001102022100111222101 |
4 | 22100100000213211 |
5 | 140022033104113 |
6 | 5020303332101 |
7 | 536560612456 |
oct | 122020004745 |
9 | 31368314871 |
10 | 11010050533 |
11 | 473a982a19 |
12 | 21732b1031 |
13 | 1066036201 |
14 | 76636912d |
15 | 4468c72dd |
hex | 2904009e5 |
11010050533 has 2 divisors, whose sum is σ = 11010050534. Its totient is φ = 11010050532.
The previous prime is 11010050509. The next prime is 11010050543. The reversal of 11010050533 is 33505001011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10375867044 + 634183489 = 101862^2 + 25183^2 .
It is an emirp because it is prime and its reverse (33505001011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11010050533 - 225 = 10976496101 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11010050533.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11010050543) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505025266 + 5505025267.
It is an arithmetic number, because the mean of its divisors is an integer number (5505025267).
Almost surely, 211010050533 is an apocalyptic number.
It is an amenable number.
11010050533 is a deficient number, since it is larger than the sum of its proper divisors (1).
11010050533 is an equidigital number, since it uses as much as digits as its factorization.
11010050533 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 225, while the sum is 19.
Adding to 11010050533 its reverse (33505001011), we get a palindrome (44515051544).
The spelling of 11010050533 in words is "eleven billion, ten million, fifty thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •