Search a number
-
+
11056825695 = 351136523201
BaseRepresentation
bin10100100110000100…
…11100010101011111
31001112120100221102210
422103002130111133
5140121021410240
65025054051503
7540666316266
oct122302342537
931476327383
1011056825695
114764320883
122186aa9b93
131072932816
1476c6635dd
1544aa66780
hex29309c55f

11056825695 has 16 divisors (see below), whose sum is σ = 17847480672. Its totient is φ = 5844787200.

The previous prime is 11056825643. The next prime is 11056825723. The reversal of 11056825695 is 59652865011.

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

It is not a de Polignac number, because 11056825695 - 26 = 11056825631 is a prime.

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

It is a congruent number.

It is an unprimeable number.

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 15 ways as a sum of consecutive naturals, for example, 3259906 + ... + 3263295.

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

Almost surely, 211056825695 is an apocalyptic number.

11056825695 is a gapful number since it is divisible by the number (15) formed by its first and last digit.

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

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

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

The sum of its prime factors is 6523322.

The product of its (nonzero) digits is 648000, while the sum is 48.

The spelling of 11056825695 in words is "eleven billion, fifty-six million, eight hundred twenty-five thousand, six hundred ninety-five".

Divisors: 1 3 5 15 113 339 565 1695 6523201 19569603 32616005 97848015 737121713 2211365139 3685608565 11056825695