Search a number
-
+
11550023021567 is a prime number
BaseRepresentation
bin1010100000010011001100…
…0001001111001111111111
31111220011121222000011211102
42220010303001033033333
53003213421343142232
640322001325443315
72301314223551012
oct250046301171777
944804558004742
1011550023021567
113753378983948
12136657b41053b
1365a216012374
142bd04a19d379
15150698bcd662
hexa813304f3ff

11550023021567 has 2 divisors, whose sum is σ = 11550023021568. Its totient is φ = 11550023021566.

The previous prime is 11550023021513. The next prime is 11550023021573. The reversal of 11550023021567 is 76512032005511.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 11550023021567 - 218 = 11550022759423 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 11550023021567.

It is a congruent number.

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

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

Almost surely, 211550023021567 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 63000, while the sum is 38.

The spelling of 11550023021567 in words is "eleven trillion, five hundred fifty billion, twenty-three million, twenty-one thousand, five hundred sixty-seven".