Search a number
-
+
91460000001 = 3791753220141
BaseRepresentation
bin101010100101101110…
…0001101100100000001
322202002000010101121110
41111023130031210001
52444302230000001
6110003253113533
76415315113216
oct1251334154401
9282060111543
1091460000001
1135873870767
12158859288a9
13881744a9c6
1445d8b8bb0d
1525a46243d6
hex154b70d901

91460000001 has 16 divisors (see below), whose sum is σ = 123561301760. Its totient is φ = 60166903680.

The previous prime is 91459999999. The next prime is 91460000081. The reversal of 91460000001 is 10000006419.

It is not a de Polignac number, because 91460000001 - 21 = 91459999999 is a prime.

It is a Duffinian number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 305391 + ... + 525531.

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

Almost surely, 291460000001 is an apocalyptic number.

It is an amenable number.

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

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

91460000001 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 221976.

The product of its (nonzero) digits is 216, while the sum is 21.

The spelling of 91460000001 in words is "ninety-one billion, four hundred sixty million, one", and thus it is an aban number.

Divisors: 1 3 79 237 1753 5259 138487 220141 415461 660423 17391139 52173417 385907173 1157721519 30486666667 91460000001