Search a number
-
+
105005510051 = 1321923132309
BaseRepresentation
bin110000111001011010…
…0001110110110100011
3101001001000101121011212
41201302310032312203
53210022402310201
6120123332300335
710405064052161
oct1416264166643
9331030347155
10105005510051
1140594966972
12184261716ab
139b9584a300
145121b58231
152ae88cdabb
hex1872d0eda3

105005510051 has 12 divisors (see below), whose sum is σ = 113713623360. Its totient is φ = 96920123040.

The previous prime is 105005510039. The next prime is 105005510237. The reversal of 105005510051 is 150015500501.

It is a happy number.

It is not a de Polignac number, because 105005510051 - 214 = 105005493667 is a prime.

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

It is a Duffinian number.

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

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

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

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

Almost surely, 2105005510051 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 625, while the sum is 23.

The spelling of 105005510051 in words is "one hundred five billion, five million, five hundred ten thousand, fifty-one".

Divisors: 1 13 169 19231 32309 250003 420017 3250039 5460221 621334379 8077346927 105005510051