Search a number
-
+
105012707635 = 5118323003879
BaseRepresentation
bin110000111001100111…
…1101100000100110011
3101001001111221021102001
41201303033230010303
53210031223121020
6120124150434431
710405212200323
oct1416317540463
9331044837361
10105012707635
1140598a32590
1218428662a17
139b9719a434
145122aad283
152ae935150a
hex18733ec133

105012707635 has 16 divisors (see below), whose sum is σ = 139127466240. Its totient is φ = 75452719840.

The previous prime is 105012707629. The next prime is 105012707689. The reversal of 105012707635 is 536707210501.

It is not a de Polignac number, because 105012707635 - 25 = 105012707603 is a prime.

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

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

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11497375 + ... + 11506504.

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

Almost surely, 2105012707635 is an apocalyptic number.

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

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

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

The sum of its prime factors is 23003978.

The product of its (nonzero) digits is 44100, while the sum is 37.

The spelling of 105012707635 in words is "one hundred five billion, twelve million, seven hundred seven thousand, six hundred thirty-five".

Divisors: 1 5 11 55 83 415 913 4565 23003879 115019395 253042669 1265213345 1909321957 9546609785 21002541527 105012707635