Search a number
-
+
91104940507 = 749130798609
BaseRepresentation
bin101010011011001000…
…1110001000111011011
322201011021000111112211
41110312101301013123
52443040331044012
6105504131015551
76403444134310
oct1246621610733
9281137014484
1091104940507
1135701400269
12157a6a3a5b7
13878ba12929
1445a3964d07
15258338b6a7
hex15364711db

91104940507 has 16 divisors (see below), whose sum is σ = 104377996800. Its totient is φ = 77896546560.

The previous prime is 91104940501. The next prime is 91104940571. The reversal of 91104940507 is 70504940119.

It is not a de Polignac number, because 91104940507 - 223 = 91096551899 is a prime.

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

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

It is not an unprimeable number, because it can be changed into a prime (91104940501) 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 in 15 ways as a sum of consecutive naturals, for example, 10578219 + ... + 10586827.

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

Almost surely, 291104940507 is an apocalyptic number.

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

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

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

The sum of its prime factors is 12186.

The product of its (nonzero) digits is 45360, while the sum is 40.

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

Divisors: 1 7 491 3079 3437 8609 21553 60263 1511789 4227019 10582523 26507111 29589133 185549777 13014991501 91104940507