Search a number
-
+
107115012460 = 2255699412567
BaseRepresentation
bin110001111000010001…
…1010110000101101100
3101020111000210102110201
41203300203112011230
53223332420344320
6121112530243244
710511260404031
oct1436043260554
9336430712421
10107115012460
11414776a5295
1218914726524
13a1408b43a1
145281d99388
152bbdbc170a
hex18f08d616c

107115012460 has 24 divisors (see below), whose sum is σ = 225336877920. Its totient is φ = 42770699904.

The previous prime is 107115012457. The next prime is 107115012491. The reversal of 107115012460 is 64210511701.

It is a super-2 number, since 2×1071150124602 (a number of 23 digits) contains 22 as substring.

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, 4694904 + ... + 4717663.

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

Almost surely, 2107115012460 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

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

The product of its (nonzero) digits is 1680, while the sum is 28.

The spelling of 107115012460 in words is "one hundred seven billion, one hundred fifteen million, twelve thousand, four hundred sixty".

Divisors: 1 2 4 5 10 20 569 1138 2276 2845 5690 11380 9412567 18825134 37650268 47062835 94125670 188251340 5355750623 10711501246 21423002492 26778753115 53557506230 107115012460