Search a number
-
+
11500552731 = 319201764083
BaseRepresentation
bin10101011010111110…
…01000001000011011
31002200111022121111110
422231133020020123
5142023120141411
65141104431403
7554665041153
oct125537101033
932614277443
1011500552731
114971842538
12228b618563
1311138441b5
147b156b763
154749b62a6
hex2ad7c821b

11500552731 has 8 divisors (see below), whose sum is σ = 16141126720. Its totient is φ = 7263506952.

The previous prime is 11500552729. The next prime is 11500552771. The reversal of 11500552731 is 13725500511.

11500552731 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 11500552731 - 21 = 11500552729 is a prime.

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

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 100881985 + ... + 100882098.

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

Almost surely, 211500552731 is an apocalyptic number.

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

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

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

The sum of its prime factors is 201764105.

The product of its (nonzero) digits is 5250, while the sum is 30.

The spelling of 11500552731 in words is "eleven billion, five hundred million, five hundred fifty-two thousand, seven hundred thirty-one".

Divisors: 1 3 19 57 201764083 605292249 3833517577 11500552731