Search a number
-
+
10155251569 is a prime number
BaseRepresentation
bin10010111010100110…
…01101011101110001
3222012201220020020111
421131103031131301
5131244221022234
64355410141321
7506441133301
oct113523153561
928181806214
1010155251569
1143414138a1
121b74b81841
13c5ac077c8
146c4a17601
153e6828664
hex25d4cd771

10155251569 has 2 divisors, whose sum is σ = 10155251570. Its totient is φ = 10155251568.

The previous prime is 10155251539. The next prime is 10155251593. The reversal of 10155251569 is 96515255101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 5507420944 + 4647830625 = 74212^2 + 68175^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 10155251569 - 211 = 10155249521 is a prime.

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

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

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

Almost surely, 210155251569 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 67500, while the sum is 40.

The spelling of 10155251569 in words is "ten billion, one hundred fifty-five million, two hundred fifty-one thousand, five hundred sixty-nine".