Search a number
-
+
105006055105131 = 3228531531615909
BaseRepresentation
bin10111111000000010100000…
…100111010010001001101011
3111202210110222112011212101220
4113320002200213102021223
5102230404400101331011
61011155041001113123
731055302635352215
oct2770024047221153
9452713875155356
10105006055105131
11305048aa671854
12b93aa634887a3
13467904a82ac4b
141bd046a82d5b5
15c216ad8b1506
hex5f80a09d226b

105006055105131 has 8 divisors (see below), whose sum is σ = 140014200028560. Its totient is φ = 70000973459232.

The previous prime is 105006055105103. The next prime is 105006055105151. The reversal of 105006055105131 is 131501550600501.

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

It is not a de Polignac number, because 105006055105131 - 26 = 105006055105067 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 105006055105092 and 105006055105101.

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

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

Almost surely, 2105006055105131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1531638765.

The product of its (nonzero) digits is 11250, while the sum is 33.

The spelling of 105006055105131 in words is "one hundred five trillion, six billion, fifty-five million, one hundred five thousand, one hundred thirty-one".

Divisors: 1 3 22853 68559 1531615909 4594847727 35002018368377 105006055105131