Search a number
-
+
14683924835057 is a prime number
BaseRepresentation
bin1101010110101101111000…
…0111111010101011110001
31220222202202222011100210002
43111223132013322223301
53411040134224210212
651121411341515345
73043610226466022
oct325533607725361
956882688140702
1014683924835057
11475146583a9a5
121791a14872b55
138268c3bab26a
1438a9c4836c49
151a6e68ab3ac2
hexd5ade1faaf1

14683924835057 has 2 divisors, whose sum is σ = 14683924835058. Its totient is φ = 14683924835056.

The previous prime is 14683924834961. The next prime is 14683924835081. The reversal of 14683924835057 is 75053842938641.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 14663661027856 + 20263807201 = 3829316^2 + 142351^2 .

It is a cyclic number.

It is not a de Polignac number, because 14683924835057 - 220 = 14683923786481 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 14683924834984 and 14683924835002.

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

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

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

It is a 1-persistent number, because it is pandigital, but 2⋅14683924835057 = 29367849670114 is not.

Almost surely, 214683924835057 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 174182400, while the sum is 65.

The spelling of 14683924835057 in words is "fourteen trillion, six hundred eighty-three billion, nine hundred twenty-four million, eight hundred thirty-five thousand, fifty-seven".