Search a number
-
+
5091913645531 is a prime number
BaseRepresentation
bin100101000011000110110…
…1101000011110111011011
3200000210010012212002200221
41022012031231003313123
51131411214343124111
614455105352540511
71033610236600156
oct112061555036733
920023105762627
105091913645531
111693517563889
126a2a1b6b1737
132ac21c4b707b
141386428a0c9d
158c6bbaa4371
hex4a18db43ddb

5091913645531 has 2 divisors, whose sum is σ = 5091913645532. Its totient is φ = 5091913645530.

The previous prime is 5091913645477. The next prime is 5091913645583. The reversal of 5091913645531 is 1355463191905.

It is a happy number.

It is an a-pointer prime, because the next prime (5091913645583) can be obtained adding 5091913645531 to its sum of digits (52).

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 5091913645531 - 213 = 5091913637339 is a prime.

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

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

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

Almost surely, 25091913645531 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 2187000, while the sum is 52.

The spelling of 5091913645531 in words is "five trillion, ninety-one billion, nine hundred thirteen million, six hundred forty-five thousand, five hundred thirty-one".