Search a number
-
+
53095632 = 2431106159
BaseRepresentation
bin1100101010001…
…0110011010000
310200220112111220
43022202303100
5102043030012
65134005040
71213206522
oct312426320
9120815456
1053095632
1127a75597
1215946780
13b000445
1470a1a12
1549dc08c
hex32a2cd0

53095632 has 20 divisors (see below), whose sum is σ = 137163840. Its totient is φ = 17698528.

The previous prime is 53095621. The next prime is 53095639. The reversal of 53095632 is 23659035.

It is a super-2 number, since 2×530956322 = 5638292274958848, which contains 22 as substring.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 553032 + ... + 553127.

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

Almost surely, 253095632 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

The product of its (nonzero) digits is 24300, while the sum is 33.

The square root of 53095632 is about 7286.6749618739. The cubic root of 53095632 is about 375.8543649056.

The spelling of 53095632 in words is "fifty-three million, ninety-five thousand, six hundred thirty-two".

Divisors: 1 2 3 4 6 8 12 16 24 48 1106159 2212318 3318477 4424636 6636954 8849272 13273908 17698544 26547816 53095632