Search a number
-
+
105110505110 = 2513808542347
BaseRepresentation
bin110000111100100010…
…0110000011010010110
3101001022022221220022202
41201321010300122112
53210231242130420
6120142002524502
710410510360212
oct1417104603226
9331268856282
10105110505110
114063915a246
1218455366732
139bb151c570
145131a89942
152b02c1d575
hex1879130696

105110505110 has 16 divisors (see below), whose sum is σ = 203752671696. Its totient is φ = 38810032608.

The previous prime is 105110505089. The next prime is 105110505127. The reversal of 105110505110 is 11505011501.

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

It is a Curzon number.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 404271044 + ... + 404271303.

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

Almost surely, 2105110505110 is an apocalyptic number.

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

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

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

105110505110 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 808542367.

The product of its (nonzero) digits is 125, while the sum is 20.

Adding to 105110505110 its reverse (11505011501), we get a palindrome (116615516611).

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

Divisors: 1 2 5 10 13 26 65 130 808542347 1617084694 4042711735 8085423470 10511050511 21022101022 52555252555 105110505110