Search a number
-
+
105563059565258 = 2228112313863039
BaseRepresentation
bin11000000000001001010000…
…101010101011001011001010
3111211202201201010100012012102
4120000021100222223023022
5102314021121222042013
61012303000003513402
731143452011221101
oct3000112052531312
9454681633305172
10105563059565258
11306aa051112919
12ba0a9b3088862
1346b97279237a9
141c0d3ca741038
15c30e0dc84d58
hex600250aab2ca

105563059565258 has 8 divisors (see below), whose sum is σ = 158351531005440. Its totient is φ = 52779215896780.

The previous prime is 105563059565239. The next prime is 105563059565267. The reversal of 105563059565258 is 852565950365501.

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

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

It is a Curzon number.

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

It is an unprimeable number.

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, 1156885898 + ... + 1156977141.

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

Almost surely, 2105563059565258 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2313885852.

The product of its (nonzero) digits is 243000000, while the sum is 65.

The spelling of 105563059565258 in words is "one hundred five trillion, five hundred sixty-three billion, fifty-nine million, five hundred sixty-five thousand, two hundred fifty-eight".

Divisors: 1 2 22811 45622 2313863039 4627726078 52781529782629 105563059565258