Search a number
-
+
130959295 = 543609113
BaseRepresentation
bin1111100111001…
…00011110111111
3100010102102101021
413303210132333
5232011144140
620554525011
73150064345
oct763443677
9303372337
10130959295
1167a17725
1237a36767
132119330c
141356d995
15b76cb4a
hex7ce47bf

130959295 has 8 divisors (see below), whose sum is σ = 160806096. Its totient is φ = 102330816.

The previous prime is 130959293. The next prime is 130959307. The reversal of 130959295 is 592959031.

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

It is a cyclic number.

It is not a de Polignac number, because 130959295 - 21 = 130959293 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (43).

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 2130959295 is an apocalyptic number.

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

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

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

The sum of its prime factors is 609161.

The product of its (nonzero) digits is 109350, while the sum is 43.

The square root of 130959295 is about 11443.7447979234. The cubic root of 130959295 is about 507.8226991466.

The spelling of 130959295 in words is "one hundred thirty million, nine hundred fifty-nine thousand, two hundred ninety-five".

Divisors: 1 5 43 215 609113 3045565 26191859 130959295