Search a number
-
+
53021505001 = 100823525887
BaseRepresentation
bin110001011000010100…
…111111010111101001
312001212011022112021111
4301120110333113221
51332042001130001
640205134510321
73554631233143
oct613024772751
9161764275244
1053021505001
1120539291523
12a3389653a1
134ccca436ca
1427cdb33c93
1515a4c85851
hexc5853f5e9

53021505001 has 4 divisors (see below), whose sum is σ = 53022131712. Its totient is φ = 53020878292.

The previous prime is 53021504993. The next prime is 53021505059. The reversal of 53021505001 is 10050512035.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 10050512035 = 52010102407.

It is a cyclic number.

It is not a de Polignac number, because 53021505001 - 23 = 53021504993 is a prime.

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

It is a Duffinian number.

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

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

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

Almost surely, 253021505001 is an apocalyptic number.

It is an amenable number.

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

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

53021505001 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 626710.

The product of its (nonzero) digits is 750, while the sum is 22.

The spelling of 53021505001 in words is "fifty-three billion, twenty-one million, five hundred five thousand, one".

Divisors: 1 100823 525887 53021505001