Search a number
-
+
91313682851 is a prime number
BaseRepresentation
bin101010100001010111…
…0000011100110100011
322201200210210201012202
41111002232003212203
52444002300322401
6105540545043415
76411560332466
oct1250256034643
9281623721182
1091313682851
11357a92144a6
121584492656b
1387c303b201
1445c35812dd
15259687106b
hex1542b839a3

91313682851 has 2 divisors, whose sum is σ = 91313682852. Its totient is φ = 91313682850.

The previous prime is 91313682847. The next prime is 91313682869. The reversal of 91313682851 is 15828631319.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 91313682851 - 22 = 91313682847 is a prime.

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

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

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

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

Almost surely, 291313682851 is an apocalyptic number.

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

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

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

The product of its digits is 311040, while the sum is 47.

The spelling of 91313682851 in words is "ninety-one billion, three hundred thirteen million, six hundred eighty-two thousand, eight hundred fifty-one".