Search a number
-
+
10152980111 is a prime number
BaseRepresentation
bin10010111010010101…
…00010111010001111
3222012120121211101102
421131022202322033
5131243130330421
64355245333315
7506412623051
oct113512427217
928176554342
1010152980111
11434010225a
121b7426723b
13c5a5c0951
146c45c58d1
153e652a60b
hex25d2a2e8f

10152980111 has 2 divisors, whose sum is σ = 10152980112. Its totient is φ = 10152980110.

The previous prime is 10152980107. The next prime is 10152980141. The reversal of 10152980111 is 11108925101.

It is a weak prime.

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

It is a cyclic number.

It is not a de Polignac number, because 10152980111 - 22 = 10152980107 is a prime.

It is a Sophie Germain prime.

It is a congruent number.

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

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

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

Almost surely, 210152980111 is an apocalyptic number.

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

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

10152980111 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 720, while the sum is 29.

The spelling of 10152980111 in words is "ten billion, one hundred fifty-two million, nine hundred eighty thousand, one hundred eleven".