Search a number
-
+
130150315110 = 2354338343837
BaseRepresentation
bin111100100110110010…
…0000011010001100110
3110102221101210001012010
41321031210003101212
54113021440040420
6135442404535050
712255150265554
oct1711544032146
9412841701163
10130150315110
11502185070a2
12212830b1486
13c372083c9a
146429436bd4
1535bb1564e0
hex1e4d903466

130150315110 has 16 divisors (see below), whose sum is σ = 312360756336. Its totient is φ = 34706750688.

The previous prime is 130150315093. The next prime is 130150315121. The reversal of 130150315110 is 11513051031.

It is a congruent number.

It is an unprimeable number.

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 7 ways as a sum of consecutive naturals, for example, 2169171889 + ... + 2169171948.

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

Almost surely, 2130150315110 is an apocalyptic number.

130150315110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

130150315110 is an abundant number, since it is smaller than the sum of its proper divisors (182210441226).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 4338343847.

The product of its (nonzero) digits is 225, while the sum is 21.

Adding to 130150315110 its reverse (11513051031), we get a palindrome (141663366141).

The spelling of 130150315110 in words is "one hundred thirty billion, one hundred fifty million, three hundred fifteen thousand, one hundred ten".

Divisors: 1 2 3 5 6 10 15 30 4338343837 8676687674 13015031511 21691719185 26030063022 43383438370 65075157555 130150315110