Search a number
-
+
53032201551 = 337280593659
BaseRepresentation
bin110001011000111101…
…110010110101001111
312001212220102222012000
4301120331302311033
51332102220422201
640210200043343
73555121163340
oct613075626517
9161786388160
1053032201551
1120544327a4a
12a340463553
13500201a324
1427d131a0c7
1515a5b99d86
hexc58f72d4f

53032201551 has 16 divisors (see below), whose sum is σ = 89789971200. Its totient is φ = 30304115064.

The previous prime is 53032201501. The next prime is 53032201577. The reversal of 53032201551 is 15510223035.

It is a happy number.

It is not a de Polignac number, because 53032201551 - 217 = 53032070479 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (27).

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (53032201501) 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, 140296641 + ... + 140297018.

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

Almost surely, 253032201551 is an apocalyptic number.

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

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

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

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

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

Adding to 53032201551 its reverse (15510223035), we get a palindrome (68542424586).

The spelling of 53032201551 in words is "fifty-three billion, thirty-two million, two hundred one thousand, five hundred fifty-one".

Divisors: 1 3 7 9 21 27 63 189 280593659 841780977 1964155613 2525342931 5892466839 7576028793 17677400517 53032201551