Search a number
-
+
100509600051 = 3271595390477
BaseRepresentation
bin101110110011011010…
…1101100100100110011
3100121102200112201002200
41131212311230210303
53121320424200201
6114101245314243
710155502334640
oct1354665544463
9317380481080
10100509600051
113969805a173
1217590565983
13962a276333
144c169d4dc7
152933d4c386
hex1766d6c933

100509600051 has 12 divisors (see below), whose sum is σ = 165920609712. Its totient is φ = 57434057136.

The previous prime is 100509600047. The next prime is 100509600077. The reversal of 100509600051 is 150006905001.

100509600051 is a `hidden beast` number, since 1 + 0 + 0 + 5 + 0 + 9 + 600 + 0 + 51 = 666.

It is not a de Polignac number, because 100509600051 - 22 = 100509600047 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 100509599988 and 100509600024.

It is not an unprimeable number, because it can be changed into a prime (100509600001) by changing a digit.

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 797695176 + ... + 797695301.

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

Almost surely, 2100509600051 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 1350, while the sum is 27.

The spelling of 100509600051 in words is "one hundred billion, five hundred nine million, six hundred thousand, fifty-one".

Divisors: 1 3 7 9 21 63 1595390477 4786171431 11167733339 14358514293 33503200017 100509600051