Search a number
-
+
11057115767 = 23321474127
BaseRepresentation
bin10100100110000111…
…00011001001110111
31001112120220200100012
422103003203021313
5140121110201032
65025104210435
7541001635055
oct122303431167
931476820305
1011057115767
1147644a9805
122187009a1b
131072a04869
1476c6db1d5
1544aac26b2
hex2930e3277

11057115767 has 4 divisors (see below), whose sum is σ = 11057613216. Its totient is φ = 11056618320.

The previous prime is 11057115763. The next prime is 11057115787. The reversal of 11057115767 is 76751175011.

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

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

It is a cyclic number.

It is not a de Polignac number, because 11057115767 - 22 = 11057115763 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 211057115767 is an apocalyptic number.

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

11057115767 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 497448.

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

The spelling of 11057115767 in words is "eleven billion, fifty-seven million, one hundred fifteen thousand, seven hundred sixty-seven".

Divisors: 1 23321 474127 11057115767