Search a number
-
+
915750091969 is a prime number
BaseRepresentation
bin11010101001101101111…
…01010111110011000001
310020112201012100122122221
431110312331113303001
5110000424010420334
61540404554331041
7123106066231006
oct15246675276301
93215635318587
10915750091969
11323405065029
1212958aa29a81
136847c83275b
14324730a38ad
1518c4a10a8b4
hexd536f57cc1

915750091969 has 2 divisors, whose sum is σ = 915750091970. Its totient is φ = 915750091968.

The previous prime is 915750091961. The next prime is 915750091987. The reversal of 915750091969 is 969190057519.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 619269841969 + 296480250000 = 786937^2 + 544500^2 .

It is a cyclic number.

It is not a de Polignac number, because 915750091969 - 23 = 915750091961 is a prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 2915750091969 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6889050, while the sum is 61.

The spelling of 915750091969 in words is "nine hundred fifteen billion, seven hundred fifty million, ninety-one thousand, nine hundred sixty-nine".