Search a number
-
+
105663265 = 5237112941
BaseRepresentation
bin1100100110001…
…00101100100001
321100211020202021
412103010230201
5204022211030
614252421441
72422060111
oct623045441
9240736667
10105663265
115470a414
122b477881
1318b77456
1410067041
15942297a
hex64c4b21

105663265 has 16 divisors (see below), whose sum is σ = 134182656. Its totient is φ = 79710400.

The previous prime is 105663253. The next prime is 105663281. The reversal of 105663265 is 562366501.

It is not a de Polignac number, because 105663265 - 219 = 105138977 is a prime.

It is a super-2 number, since 2×1056632652 = 22329451140920450, which contains 22 as substring.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 105663265.

It is an unprimeable number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1695 + ... + 14635.

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

Almost surely, 2105663265 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 13040.

The product of its (nonzero) digits is 32400, while the sum is 34.

The square root of 105663265 is about 10279.2638355088. The cubic root of 105663265 is about 472.7606728631.

It can be divided in two parts, 10566 and 3265, that added together give a palindrome (13831).

The spelling of 105663265 in words is "one hundred five million, six hundred sixty-three thousand, two hundred sixty-five".

Divisors: 1 5 23 71 115 355 1633 8165 12941 64705 297643 918811 1488215 4594055 21132653 105663265