Search a number
-
+
150211055567 is a prime number
BaseRepresentation
bin1000101111100101000…
…1101100111111001111
3112100201110121020200102
42023321101230333033
54430113012234232
6153001144121315
713565240622416
oct2137121547717
9470643536612
10150211055567
1158782252341
122514146623b
131121b207901
1473ad81047d
153d923be662
hex22f946cfcf

150211055567 has 2 divisors, whose sum is σ = 150211055568. Its totient is φ = 150211055566.

The previous prime is 150211055539. The next prime is 150211055591. The reversal of 150211055567 is 765550112051.

It is a happy number.

It is a strong prime.

It is an emirp because it is prime and its reverse (765550112051) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 150211055567 - 26 = 150211055503 is a prime.

It is a super-2 number, since 2×1502110555672 (a number of 23 digits) contains 22 as substring.

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

It is a congruent number.

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

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

Almost surely, 2150211055567 is an apocalyptic number.

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

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

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

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

The spelling of 150211055567 in words is "one hundred fifty billion, two hundred eleven million, fifty-five thousand, five hundred sixty-seven".