Search a number
-
+
11065464536 = 237197597581
BaseRepresentation
bin10100100111000110…
…11001011011011000
31001120011121211200212
422103203121123120
5140130224331121
65030003150252
7541132616360
oct122343313330
931504554625
1011065464536
114769191315
122189975388
131074668969
1476d8719a0
1544b6c125b
hex2938d96d8

11065464536 has 16 divisors (see below), whose sum is σ = 23711709840. Its totient is φ = 4742341920.

The previous prime is 11065464493. The next prime is 11065464541. The reversal of 11065464536 is 63546456011.

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

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

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 3 ways as a sum of consecutive naturals, for example, 98798735 + ... + 98798846.

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

Almost surely, 211065464536 is an apocalyptic number.

It is an amenable number.

11065464536 is an abundant number, since it is smaller than the sum of its proper divisors (12646245304).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

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

The spelling of 11065464536 in words is "eleven billion, sixty-five million, four hundred sixty-four thousand, five hundred thirty-six".

Divisors: 1 2 4 7 8 14 28 56 197597581 395195162 790390324 1383183067 1580780648 2766366134 5532732268 11065464536