Search a number
-
+
11048547805853 is a prime number
BaseRepresentation
bin1010000011000111000011…
…0001000110101010011101
31110010020020021220202001212
42200301300301012222131
52422004411214241403
635255344403314205
72220142212550025
oct240616061065235
943106207822055
1011048547805853
11357a732224008
1212a534837b965
13621b4836c2ac
142a2a77088a85
151425e87e94d8
hexa0c70c46a9d

11048547805853 has 2 divisors, whose sum is σ = 11048547805854. Its totient is φ = 11048547805852.

The previous prime is 11048547805849. The next prime is 11048547805879. The reversal of 11048547805853 is 35850874584011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 9078572746489 + 1969975059364 = 3013067^2 + 1403558^2 .

It is a cyclic number.

It is not a de Polignac number, because 11048547805853 - 22 = 11048547805849 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 11048547805792 and 11048547805801.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (11048547805453) 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, 5524273902926 + 5524273902927.

It is an arithmetic number, because the mean of its divisors is an integer number (5524273902927).

Almost surely, 211048547805853 is an apocalyptic number.

It is an amenable number.

11048547805853 is a deficient number, since it is larger than the sum of its proper divisors (1).

11048547805853 is an equidigital number, since it uses as much as digits as its factorization.

11048547805853 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 21504000, while the sum is 59.

The spelling of 11048547805853 in words is "eleven trillion, forty-eight billion, five hundred forty-seven million, eight hundred five thousand, eight hundred fifty-three".