Search a number
-
+
10151163546659 is a prime number
BaseRepresentation
bin1001001110111000000001…
…1111110100110000100011
31022221102221001010001122122
42103232000133310300203
52312304040331443114
633331214040254455
72065253203320002
oct223560037646043
938842831101578
1010151163546659
1132640a21aaa83
12117b44417142b
135883347a7a15
14271467240c39
151290c5c5be8e
hex93b807f4c23

10151163546659 has 2 divisors, whose sum is σ = 10151163546660. Its totient is φ = 10151163546658.

The previous prime is 10151163546619. The next prime is 10151163546661. The reversal of 10151163546659 is 95664536115101.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-10151163546659 is a prime.

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

Together with 10151163546661, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

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

Almost surely, 210151163546659 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 2916000, while the sum is 53.

The spelling of 10151163546659 in words is "ten trillion, one hundred fifty-one billion, one hundred sixty-three million, five hundred forty-six thousand, six hundred fifty-nine".