Search a number
-
+
43410111132 = 22333110929031
BaseRepresentation
bin101000011011011100…
…011011101010011100
311011001022210010112210
4220123130123222130
51202400442024012
631535313200420
73064512566523
oct503334335234
9134038703483
1043410111132
1117456970003
1284b5b60110
13412a7086bb
14215b44b4ba
1511e108a23c
hexa1b71ba9c

43410111132 has 24 divisors (see below), whose sum is σ = 101596281472. Its totient is φ = 14426319600.

The previous prime is 43410111109. The next prime is 43410111137. The reversal of 43410111132 is 23111101434.

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

It is a congruent number.

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

Almost surely, 243410111132 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

The product of its (nonzero) digits is 288, while the sum is 21.

Adding to 43410111132 its reverse (23111101434), we get a palindrome (66521212566).

The spelling of 43410111132 in words is "forty-three billion, four hundred ten million, one hundred eleven thousand, one hundred thirty-two".

Divisors: 1 2 3 4 6 12 331 662 993 1324 1986 3972 10929031 21858062 32787093 43716124 65574186 131148372 3617509261 7235018522 10852527783 14470037044 21705055566 43410111132