Search a number
-
+
15423706691 is a prime number
BaseRepresentation
bin11100101110101001…
…10001011001000011
31110210220102110222222
432113110301121003
5223041432103231
611030251321255
71054133225621
oct162724613103
943726373888
1015423706691
1165a530a138
122ba545022b
1315ba56ac83
14a645da511
1560410c27b
hex397531643

15423706691 has 2 divisors, whose sum is σ = 15423706692. Its totient is φ = 15423706690.

The previous prime is 15423706687. The next prime is 15423706693. The reversal of 15423706691 is 19660732451.

15423706691 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 15423706691 - 22 = 15423706687 is a prime.

It is a Sophie Germain prime.

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

It is a Chen prime.

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

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

Almost surely, 215423706691 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 272160, while the sum is 44.

The spelling of 15423706691 in words is "fifteen billion, four hundred twenty-three million, seven hundred six thousand, six hundred ninety-one".