Search a number
-
+
53253305531 = 286491858819
BaseRepresentation
bin110001100110001001…
…001111010010111011
312002110022111012211022
4301212021033102323
51333030321234111
640244135053055
73563444425346
oct614611172273
9162408435738
1053253305531
1120648114708
12a3a251118b
135038a8339a
14281283345d
1515ba2c22db
hexc6624f4bb

53253305531 has 4 divisors (see below), whose sum is σ = 53255193000. Its totient is φ = 53251418064.

The previous prime is 53253305527. The next prime is 53253305543. The reversal of 53253305531 is 13550335235.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 53253305531 - 22 = 53253305527 is a prime.

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

It is a Duffinian number.

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

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

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

Almost surely, 253253305531 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1887468.

The product of its (nonzero) digits is 101250, while the sum is 35.

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

Divisors: 1 28649 1858819 53253305531