Search a number
-
+
91461107976 = 23372232791861
BaseRepresentation
bin101010100101110000…
…0011100000100001000
322202002002012200110120
41111023200130010020
52444303020423401
6110003332543240
76415330406400
oct1251340340410
9282062180416
1091461107976
1135874458147
1215886181b20
138817748104
1445d8d99800
1525a4792836
hex154b81c108

91461107976 has 288 divisors, whose sum is σ = 281722089600. Its totient is φ = 24665921280.

The previous prime is 91461107929. The next prime is 91461107977. The reversal of 91461107976 is 67970116419.

It is not an unprimeable number, because it can be changed into a prime (91461107977) by changing a digit.

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

It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 49145286 + ... + 49147146.

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

Almost surely, 291461107976 is an apocalyptic number.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 91461107976, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (140861044800).

91461107976 is an abundant number, since it is smaller than the sum of its proper divisors (190260981624).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

91461107976 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 2009 (or 1975 counting only the distinct ones).

The product of its (nonzero) digits is 571536, while the sum is 51.

The spelling of 91461107976 in words is "ninety-one billion, four hundred sixty-one million, one hundred seven thousand, nine hundred seventy-six".