Search a number
-
+
91464548957 is a prime number
BaseRepresentation
bin101010100101110110…
…1100100001001011101
322202002022200111121022
41111023231210021131
52444304411031312
6110003534413525
76415401560405
oct1251355441135
9282068614538
1091464548957
1135876398431
12158873612a5
1388183813b2
1445d9613805
1525a4c22172
hex154bb6425d

91464548957 has 2 divisors, whose sum is σ = 91464548958. Its totient is φ = 91464548956.

The previous prime is 91464548947. The next prime is 91464548993. The reversal of 91464548957 is 75984546419.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 60841648921 + 30622900036 = 246661^2 + 174994^2 .

It is a cyclic number.

It is not a de Polignac number, because 91464548957 - 226 = 91397440093 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 91464548957.

It is a congruent number.

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

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

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

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

Almost surely, 291464548957 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 43545600, while the sum is 62.

The spelling of 91464548957 in words is "ninety-one billion, four hundred sixty-four million, five hundred forty-eight thousand, nine hundred fifty-seven".