Search a number
-
+
105521113064 = 2326987488759
BaseRepresentation
bin110001001000110001…
…1000110011111101000
3101002100221120221112202
41202101203012133220
53212101401104224
6120250431355332
710423624443023
oct1422143063750
9332327527482
10105521113064
1140829a10064
121854a982b48
139c48606353
1451704121ba
152b28cc9eae
hex18918c67e8

105521113064 has 16 divisors (see below), whose sum is σ = 197859823200. Its totient is φ = 52758493552.

The previous prime is 105521113051. The next prime is 105521113069. The reversal of 105521113064 is 460311125501.

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

It is not an unprimeable number, because it can be changed into a prime (105521113069) 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 3 ways as a sum of consecutive naturals, for example, 28484 + ... + 460275.

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

Almost surely, 2105521113064 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 3600, while the sum is 29.

Adding to 105521113064 its reverse (460311125501), we get a palindrome (565832238565).

The spelling of 105521113064 in words is "one hundred five billion, five hundred twenty-one million, one hundred thirteen thousand, sixty-four".

Divisors: 1 2 4 8 26987 53974 107948 215896 488759 977518 1955036 3910072 13190139133 26380278266 52760556532 105521113064