Search a number
-
+
105071221515651 = 3311911229156943
BaseRepresentation
bin10111111000111111001100…
…110101011010010110000011
3111210000201012002021112000220
4113320333030311122112003
5102232441330202000101
61011245015223314123
731063100550613236
oct2770771465322603
9453021162245026
10105071221515651
113052a500387576
12b94b60b5ab943
134682234740281
141bd368d50141d
15c2322498c636
hex5f8fccd5a583

105071221515651 has 8 divisors (see below), whose sum is σ = 140139878661120. Its totient is φ = 70025022690312.

The previous prime is 105071221515599. The next prime is 105071221515677. The reversal of 105071221515651 is 156515122170501.

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

It is not a de Polignac number, because 105071221515651 - 213 = 105071221507459 is a prime.

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

It is not an unprimeable number, because it can be changed into a prime (105071221515151) 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, 5614569115 + ... + 5614587828.

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

Almost surely, 2105071221515651 is an apocalyptic number.

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

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

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

The sum of its prime factors is 11229160065.

The product of its (nonzero) digits is 105000, while the sum is 42.

The spelling of 105071221515651 in words is "one hundred five trillion, seventy-one billion, two hundred twenty-one million, five hundred fifteen thousand, six hundred fifty-one".

Divisors: 1 3 3119 9357 11229156943 33687470829 35023740505217 105071221515651