Search a number
-
+
530113215 = 3535340881
BaseRepresentation
bin11111100110001…
…110001010111111
31100221111112121210
4133212032022333
52041202110330
6124334055503
716064613402
oct3746161277
91327445553
10530113215
112522649a5
1212964a593
1385a99778
1450593d39
15318158b0
hex1f98e2bf

530113215 has 8 divisors (see below), whose sum is σ = 848181168. Its totient is φ = 282727040.

The previous prime is 530113211. The next prime is 530113217. The reversal of 530113215 is 512311035.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 530113215 - 22 = 530113211 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2530113215 is an apocalyptic number.

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

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

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

The sum of its prime factors is 35340889.

The product of its (nonzero) digits is 450, while the sum is 21.

The square root of 530113215 is about 23024.1876078180. The cubic root of 530113215 is about 809.3248527439.

The spelling of 530113215 in words is "five hundred thirty million, one hundred thirteen thousand, two hundred fifteen".

Divisors: 1 3 5 15 35340881 106022643 176704405 530113215