Search a number
-
+
105695064 = 2333489329
BaseRepresentation
bin1100100110011…
…00011101011000
321100212212101000
412103030131120
5204024220224
614253225000
72422251606
oct623143530
9240785330
10105695064
11547312a2
122b492160
1318b88a77
1410074876
15942c0c9
hex64cc758

105695064 has 32 divisors (see below), whose sum is σ = 293598000. Its totient is φ = 35231616.

The previous prime is 105695063. The next prime is 105695077. The reversal of 105695064 is 460596501.

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

It is a Harshad number since it is a multiple of its sum of digits (36).

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (105695063) by changing a digit.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 244449 + ... + 244880.

Almost surely, 2105695064 is an apocalyptic number.

It is an amenable number.

105695064 is an abundant number, since it is smaller than the sum of its proper divisors (187902936).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 489344 (or 489334 counting only the distinct ones).

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

The square root of 105695064 is about 10280.8104738877. The cubic root of 105695064 is about 472.8080933449.

The spelling of 105695064 in words is "one hundred five million, six hundred ninety-five thousand, sixty-four".

Divisors: 1 2 3 4 6 8 9 12 18 24 27 36 54 72 108 216 489329 978658 1467987 1957316 2935974 3914632 4403961 5871948 8807922 11743896 13211883 17615844 26423766 35231688 52847532 105695064