Search a number
-
+
530354154513 = 3176784718171
BaseRepresentation
bin1111011011110111001…
…00100010110000010001
31212200221021220112021110
413231323210202300101
532142131130421023
61043350310043533
753213445634551
oct7557344426021
91780837815243
10530354154513
11194a16104007
12869526495a9
133b0209c2051
141b9526db161
15dbe08b6a93
hex7b7b922c11

530354154513 has 4 divisors (see below), whose sum is σ = 707138872688. Its totient is φ = 353569436340.

The previous prime is 530354154511. The next prime is 530354154527. The reversal of 530354154513 is 315451453035.

530354154513 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.

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.

It is not a de Polignac number, because 530354154513 - 21 = 530354154511 is a prime.

It is a Duffinian number.

It is a Curzon number.

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

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

Almost surely, 2530354154513 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 176784718174.

The product of its (nonzero) digits is 270000, while the sum is 39.

The spelling of 530354154513 in words is "five hundred thirty billion, three hundred fifty-four million, one hundred fifty-four thousand, five hundred thirteen".

Divisors: 1 3 176784718171 530354154513