Search a number
-
+
10142551556569 is a prime number
BaseRepresentation
bin1001001110010111111100…
…1011101100000111011001
31022220121200212010122011201
42103211333023230013121
52312133421144302234
633323231315354201
72064526611522115
oct223457713540731
938817625118151
1010142551556569
113260482a353a3
12117983bbb2961
1358759152b6b3
14270c8b58c745
15128c6eb76314
hex9397f2ec1d9

10142551556569 has 2 divisors, whose sum is σ = 10142551556570. Its totient is φ = 10142551556568.

The previous prime is 10142551556531. The next prime is 10142551556647. The reversal of 10142551556569 is 96565515524101.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 9000030000025 + 1142521556544 = 3000005^2 + 1068888^2 .

It is a cyclic number.

It is not a de Polignac number, because 10142551556569 - 211 = 10142551554521 is a prime.

It is a super-4 number, since 4×101425515565694 (a number of 53 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.

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

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

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

Almost surely, 210142551556569 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 8100000, while the sum is 55.

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