Search a number
-
+
130111064 = 2317956699
BaseRepresentation
bin1111100000101…
…01011001011000
3100001211022211022
413300111121120
5231302023224
620524422012
73136632356
oct760253130
9301738738
10130111064
1167498406
12376a7908
1320c571c5
14133cc7d6
15b65165e
hex7c15658

130111064 has 16 divisors (see below), whose sum is σ = 258309000. Its totient is φ = 61228672.

The previous prime is 130111063. The next prime is 130111067. The reversal of 130111064 is 460111031.

130111064 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

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

It is a congruent number.

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

Almost surely, 2130111064 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 956722 (or 956718 counting only the distinct ones).

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

The square root of 130111064 is about 11406.6236897690. The cubic root of 130111064 is about 506.7239243540.

Adding to 130111064 its reverse (460111031), we get a palindrome (590222095).

The spelling of 130111064 in words is "one hundred thirty million, one hundred eleven thousand, sixty-four".

Divisors: 1 2 4 8 17 34 68 136 956699 1913398 3826796 7653592 16263883 32527766 65055532 130111064