Search a number
-
+
105056055606055 = 521011211121211
BaseRepresentation
bin10111111000110001000100…
…111000000011101100100111
3111202222021001010221111011111
4113320301010320003230213
5102232214300213343210
61011234030301245451
731062022664532331
oct2770610470035447
9452867033844144
10105056055606055
1130524028647194
12b948698563887
134680988714978
141bd2a51250451
15c22b3830488a
hex5f8c44e03b27

105056055606055 has 4 divisors (see below), whose sum is σ = 126067266727272. Its totient is φ = 84044844484840.

The previous prime is 105056055606037. The next prime is 105056055606149. The reversal of 105056055606055 is 550606550650501.

It is a semiprime because it is the product of two primes.

It is not a de Polignac number, because 105056055606055 - 211 = 105056055604007 is a prime.

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

It is a Duffinian number.

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 2105056055606055 is an apocalyptic number.

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

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

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

The sum of its prime factors is 21011211121216.

The product of its (nonzero) digits is 3375000, while the sum is 49.

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

Divisors: 1 5 21011211121211 105056055606055