Search a number
-
+
105813017761 = 1159163040089
BaseRepresentation
bin110001010001011110…
…0101000010010100001
3101010010021212020111211
41202202330220102201
53213201113032021
6120335420110121
710434100545103
oct1424274502241
9333107766454
10105813017761
1140969765410
1218610695341
139c93c2b519
14519b0b9573
152b4473a3e1
hex18a2f284a1

105813017761 has 8 divisors (see below), whose sum is σ = 117388864800. Its totient is φ = 94563251040.

The previous prime is 105813017753. The next prime is 105813017899. The reversal of 105813017761 is 167710318501.

It is a happy number.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 105813017761 - 23 = 105813017753 is a prime.

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

It is a Duffinian number.

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

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

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

Almost surely, 2105813017761 is an apocalyptic number.

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

It is an amenable number.

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

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

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

The sum of its prime factors is 163040159.

The product of its (nonzero) digits is 35280, while the sum is 40.

The spelling of 105813017761 in words is "one hundred five billion, eight hundred thirteen million, seventeen thousand, seven hundred sixty-one".

Divisors: 1 11 59 649 163040089 1793440979 9619365251 105813017761