Search a number
-
+
105576905513 = 167632197039
BaseRepresentation
bin110001001010011011…
…1111011101100101001
3101002111211120111101202
41202110313323230221
53212210141434023
6120300143253545
710425202614152
oct1422467735451
9332454514352
10105576905513
1140858457822
12185655aa2b5
139c5703c131
1451779b6929
152b2db4b128
hex1894dfbb29

105576905513 has 4 divisors (see below), whose sum is σ = 106209102720. Its totient is φ = 104944708308.

The previous prime is 105576905509. The next prime is 105576905527. The reversal of 105576905513 is 315509675501.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 315509675501 = 1453217143617.

It is a cyclic number.

It is not a de Polignac number, because 105576905513 - 22 = 105576905509 is a prime.

It is a super-2 number, since 2×1055769055132 (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 (105576905113) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 316098353 + ... + 316098686.

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

Almost surely, 2105576905513 is an apocalyptic number.

It is an amenable number.

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

105576905513 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 632197206.

The product of its (nonzero) digits is 708750, while the sum is 47.

The spelling of 105576905513 in words is "one hundred five billion, five hundred seventy-six million, nine hundred five thousand, five hundred thirteen".

Divisors: 1 167 632197039 105576905513