100091510075435 has 32 divisors (see below), whose sum is σ = 122500151746560. Its totient is φ = 78510201646560.

The previous prime is 100091510075393. The next prime is 100091510075437. The reversal of 100091510075435 is 534570015190001.

It is not a de Polignac number, because 100091510075435 - 2¹⁰ = 100091510074411 is a prime.

It is a super-2 number, since 2×100091510075435² (a number of 29 digits) contains 22 as substring.

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

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

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 393173540 + ... + 393428030.

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

Almost surely, 2^{100091510075435} is an apocalyptic number.

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

100091510075435 is an frugal number, since it uses more digits than its factorization.

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

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

The product of its (nonzero) digits is 94500, while the sum is 41.

The spelling of 100091510075435 in words is "one hundred trillion, ninety-one billion, five hundred ten million, seventy-five thousand, four hundred thirty-five".