Search a number
-
+
105006060051 = 3373592635099
BaseRepresentation
bin110000111001011011…
…0010101001000010011
3101001001001102112122020
41201302312111020103
53210023022410201
6120123352142523
710405101532524
oct1416266251023
9331031375566
10105006060051
1140595202112
1218426397a43
139b959b0759
145121c5c84b
152ae898ba36
hex1872d95213

105006060051 has 16 divisors (see below), whose sum is σ = 144192672000. Its totient is φ = 67922286048.

The previous prime is 105006060043. The next prime is 105006060083. The reversal of 105006060051 is 150060600501.

It is not a de Polignac number, because 105006060051 - 23 = 105006060043 is a prime.

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

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

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

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

Almost surely, 2105006060051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2635498.

The product of its (nonzero) digits is 900, while the sum is 24.

Adding to 105006060051 its reverse (150060600501), we get a palindrome (255066660552).

It can be divided in two parts, 1050060 and 60051, that added together give a palindrome (1110111).

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

Divisors: 1 3 37 111 359 1077 13283 39849 2635099 7905297 97498663 292495989 946000541 2838001623 35002020017 105006060051