Search a number
-
+
1150021511 is a prime number
BaseRepresentation
bin100010010001011…
…1110111110000111
32222010222010221022
41010202332332013
54323401142021
6310040541355
740333010252
oct10442767607
92863863838
101150021511
11540180201
1228118185b
13154345b02
14aca40099
156ae671ab
hex448bef87

1150021511 has 2 divisors, whose sum is σ = 1150021512. Its totient is φ = 1150021510.

The previous prime is 1150021489. The next prime is 1150021517. The reversal of 1150021511 is 1151200511.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 1150021511 - 214 = 1150005127 is a prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (1150021517) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 575010755 + 575010756.

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

Almost surely, 21150021511 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 50, while the sum is 17.

The square root of 1150021511 is about 33911.9670765351. The cubic root of 1150021511 is about 1047.6960855512.

The spelling of 1150021511 in words is "one billion, one hundred fifty million, twenty-one thousand, five hundred eleven".