Search a number
-
+
130916489 = 11113105323
BaseRepresentation
bin1111100110110…
…10000010001001
3100010100020122212
413303122002021
5232003311424
620553554505
73146525504
oct763320211
9303306585
10130916489
1167998550
1237a15a35
13211799a2
141355c13b
15b76010e
hex7cda089

130916489 has 8 divisors (see below), whose sum is σ = 144083232. Its totient is φ = 117960640.

The previous prime is 130916453. The next prime is 130916497. The reversal of 130916489 is 984619031.

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 130916489 - 216 = 130850953 is a prime.

It is a Duffinian number.

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

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

Almost surely, 2130916489 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 105447.

The product of its (nonzero) digits is 46656, while the sum is 41.

The square root of 130916489 is about 11441.8743656798. The cubic root of 130916489 is about 507.7673633078.

It can be divided in two parts, 130 and 916489, that added together give a palindrome (916619).

The spelling of 130916489 in words is "one hundred thirty million, nine hundred sixteen thousand, four hundred eighty-nine".

Divisors: 1 11 113 1243 105323 1158553 11901499 130916489