Search a number
-
+
90566150511 = 330188716837
BaseRepresentation
bin101010001011000101…
…0011100100101101111
322122202201012010121210
41110112022130211233
52440434413304021
6105334442525503
76354212402064
oct1242612344557
9278681163553
1090566150511
113545525a381
1215676506893
1387041c8995
144552192c6b
152550e0ee76
hex151629c96f

90566150511 has 4 divisors (see below), whose sum is σ = 120754867352. Its totient is φ = 60377433672.

The previous prime is 90566150501. The next prime is 90566150513. The reversal of 90566150511 is 11505166509.

It is a semiprime because it is the product of two primes.

It is not a de Polignac number, because 90566150511 - 27 = 90566150383 is a prime.

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

It is a Duffinian number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (90566150513) 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 3 ways as a sum of consecutive naturals, for example, 15094358416 + ... + 15094358421.

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

Almost surely, 290566150511 is an apocalyptic number.

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

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

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

The sum of its prime factors is 30188716840.

The product of its (nonzero) digits is 40500, while the sum is 39.

The spelling of 90566150511 in words is "ninety billion, five hundred sixty-six million, one hundred fifty thousand, five hundred eleven".

Divisors: 1 3 30188716837 90566150511