Search a number
-
+
130102015 = 553490951
BaseRepresentation
bin1111100000100…
…11001011111111
3100001210212102011
413300103023333
5231301231030
620524312051
73136564111
oct760231377
9301725364
10130102015
116749162a
12376a2627
1320c53054
14133c93b1
15b64db2a
hex7c132ff

130102015 has 8 divisors (see below), whose sum is σ = 159068448. Its totient is φ = 102117600.

The previous prime is 130102013. The next prime is 130102031. The reversal of 130102015 is 510201031.

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

It is not a de Polignac number, because 130102015 - 21 = 130102013 is a prime.

It is a Duffinian number.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 245211 + ... + 245740.

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

Almost surely, 2130102015 is an apocalyptic number.

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

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

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

The sum of its prime factors is 491009.

The product of its (nonzero) digits is 30, while the sum is 13.

The square root of 130102015 is about 11406.2270273741. The cubic root of 130102015 is about 506.7121768235.

Adding to 130102015 its reverse (510201031), we get a palindrome (640303046).

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

Divisors: 1 5 53 265 490951 2454755 26020403 130102015