Search a number
-
+
130321061 = 1363115887
BaseRepresentation
bin1111100010010…
…00101010100101
3100002012222212222
413301020222211
5231330233221
620533122125
73141465533
oct761105245
9302188788
10130321061
1167621162
1237789345
1320ccb970
1413445153
15b6939ab
hex7c48aa5

130321061 has 8 divisors (see below), whose sum is σ = 140577024. Its totient is φ = 120098160.

The previous prime is 130321033. The next prime is 130321091. The reversal of 130321061 is 160123031.

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

It is not a de Polignac number, because 130321061 - 210 = 130320037 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

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

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

Almost surely, 2130321061 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 16531.

The product of its (nonzero) digits is 108, while the sum is 17.

The square root of 130321061 is about 11415.8250249380. The cubic root of 130321061 is about 506.9963923613.

Adding to 130321061 its reverse (160123031), we get a palindrome (290444092).

The spelling of 130321061 in words is "one hundred thirty million, three hundred twenty-one thousand, sixty-one".

Divisors: 1 13 631 8203 15887 206531 10024697 130321061