Search a number
-
+
8106651769 is a prime number
BaseRepresentation
bin1111000110011000…
…11011000001111001
3202220222002120121211
413203030123001321
5113100300324034
63420225403121
7404614255156
oct74314330171
922828076554
108106651769
11348aaa2507
1216a2a994a1
139c2675488
1456c90b22d
15326a65d64
hex1e331b079

8106651769 has 2 divisors, whose sum is σ = 8106651770. Its totient is φ = 8106651768.

The previous prime is 8106651757. The next prime is 8106651781. The reversal of 8106651769 is 9671566018.

It is a happy number.

It is a balanced prime because it is at equal distance from previous prime (8106651757) and next prime (8106651781).

It can be written as a sum of positive squares in only one way, i.e., 6290869225 + 1815782544 = 79315^2 + 42612^2 .

It is a cyclic number.

It is not a de Polignac number, because 8106651769 - 211 = 8106649721 is a prime.

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

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

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

Almost surely, 28106651769 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 544320, while the sum is 49.

The square root of 8106651769 is about 90036.9466885678. The cubic root of 8106651769 is about 2008.8484422195.

The spelling of 8106651769 in words is "eight billion, one hundred six million, six hundred fifty-one thousand, seven hundred sixty-nine".