Search a number
-
+
130505673 = 31492811039
BaseRepresentation
bin1111100011101…
…01101111001001
3100002120101010110
413301311233021
5231402140143
620541104533
73143165004
oct761655711
9302511113
10130505673
1167737931
1237858149
13210649bc
141349253b
15b6cd533
hex7c75bc9

130505673 has 16 divisors (see below), whose sum is σ = 175968000. Its totient is φ = 86029440.

The previous prime is 130505671. The next prime is 130505681. The reversal of 130505673 is 376505031.

It is not a de Polignac number, because 130505673 - 21 = 130505671 is a prime.

It is a Curzon number.

It is a self number, because there is not a number n which added to its sum of digits gives 130505673.

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

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

Almost surely, 2130505673 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1472.

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

The square root of 130505673 is about 11423.9079565620. The cubic root of 130505673 is about 507.2356820443.

The spelling of 130505673 in words is "one hundred thirty million, five hundred five thousand, six hundred seventy-three".

Divisors: 1 3 149 281 447 843 1039 3117 41869 125607 154811 291959 464433 875877 43501891 130505673