Search a number
-
+
530101051 = 586790353
BaseRepresentation
bin11111100110001…
…011001100111011
31100221110220221021
4133212023030323
52041201213201
6124333523311
716064533054
oct3746131473
91327426837
10530101051
11252256847
12129643537
1385a9407c
145058d72b
1531811ea1
hex1f98b33b

530101051 has 4 divisors (see below), whose sum is σ = 530197272. Its totient is φ = 530004832.

The previous prime is 530101043. The next prime is 530101057. The reversal of 530101051 is 150101035.

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 530101051 - 23 = 530101043 is a prime.

It is a Duffinian number.

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

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

Almost surely, 2530101051 is an apocalyptic number.

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

530101051 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 96220.

The product of its (nonzero) digits is 75, while the sum is 16.

The square root of 530101051 is about 23023.9234493168. The cubic root of 530101051 is about 809.3186624293.

Subtracting from 530101051 its sum of digits (16), we obtain a palindrome (530101035).

Adding to 530101051 its reverse (150101035), we get a palindrome (680202086).

The spelling of 530101051 in words is "five hundred thirty million, one hundred one thousand, fifty-one".

Divisors: 1 5867 90353 530101051