Search a number
-
+
293437051061 = 71119200572147
BaseRepresentation
bin1000100010100100011…
…01100001000010110101
31001001102010120200022012
410101102031201002311
514301424341113221
6342445250214005
730125433531410
oct4212215410265
91031363520265
10293437051061
1110349a624660
1248a53584305
132189523a77b
14102b9672b77
15797642665b
hex44523610b5

293437051061 has 16 divisors (see below), whose sum is σ = 385098524160. Its totient is φ = 216617917680.

The previous prime is 293437051043. The next prime is 293437051067. The reversal of 293437051061 is 160150734392.

It is a cyclic number.

It is not a de Polignac number, because 293437051061 - 26 = 293437050997 is a prime.

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

It is a Curzon number.

It is a congruent number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 100284611 + ... + 100287536.

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

Almost surely, 2293437051061 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 200572184.

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

The spelling of 293437051061 in words is "two hundred ninety-three billion, four hundred thirty-seven million, fifty-one thousand, sixty-one".

Divisors: 1 7 11 19 77 133 209 1463 200572147 1404005029 2206293617 3810870793 15444055319 26676095551 41919578723 293437051061