Search a number
-
+
10673156759 is a prime number
BaseRepresentation
bin10011111000010101…
…10111001010010111
31000112211102112121012
421330022313022113
5133324312004014
64523030442435
7525330223046
oct117412671227
930484375535
1010673156759
11458779a711
12209a50341b
1310112bb695
1473371055d
1542702bc3e
hex27c2b7297

10673156759 has 2 divisors, whose sum is σ = 10673156760. Its totient is φ = 10673156758.

The previous prime is 10673156677. The next prime is 10673156761. The reversal of 10673156759 is 95765137601.

It is a strong prime.

It is a cyclic number.

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

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

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

It is a Chen prime.

It is a congruent number.

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

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

Almost surely, 210673156759 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1190700, while the sum is 50.

The spelling of 10673156759 in words is "ten billion, six hundred seventy-three million, one hundred fifty-six thousand, seven hundred fifty-nine".