Search a number
-
+
11027075031 = 327175032937
BaseRepresentation
bin10100100010100001…
…11100111111010111
31001110111101110012100
422101100330333113
5140040412400111
65022112253143
7540155406540
oct122120747727
931414343170
1011027075031
114749550755
122178b411b3
13106971718b
1476871b4c7
1544813b756
hex29143cfd7

11027075031 has 12 divisors (see below), whose sum is σ = 18203425552. Its totient is φ = 6301185696.

The previous prime is 11027075029. The next prime is 11027075047. The reversal of 11027075031 is 13057072011.

It is a happy number.

It is not a de Polignac number, because 11027075031 - 21 = 11027075029 is a prime.

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

It is a Duffinian number.

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

It is a congruent number.

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

Almost surely, 211027075031 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 1470, while the sum is 27.

The spelling of 11027075031 in words is "eleven billion, twenty-seven million, seventy-five thousand, thirty-one".

Divisors: 1 3 7 9 21 63 175032937 525098811 1225230559 1575296433 3675691677 11027075031