Search a number
-
+
101465705 = 5117692399
BaseRepresentation
bin1100000110000…
…11111001101001
321001220222210002
412003003321221
5201433400310
614022432345
72341305245
oct603037151
9231828702
10101465705
1152302760
1229b926b5
13180379a3
14d693425
158d93da5
hex60c3e69

101465705 has 16 divisors (see below), whose sum is σ = 133056000. Its totient is φ = 73666560.

The previous prime is 101465701. The next prime is 101465743. The reversal of 101465705 is 507564101.

It is not a de Polignac number, because 101465705 - 22 = 101465701 is a prime.

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

It is a Curzon number.

It is not an unprimeable number, because it can be changed into a prime (101465701) 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 15 ways as a sum of consecutive naturals, for example, 41096 + ... + 43494.

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

Almost surely, 2101465705 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 3184.

The product of its (nonzero) digits is 4200, while the sum is 29.

The square root of 101465705 is about 10073.0186637373. The cubic root of 101465705 is about 466.4156266003.

It can be divided in two parts, 10146 and 5705, that added together give a palindrome (15851).

The spelling of 101465705 in words is "one hundred one million, four hundred sixty-five thousand, seven hundred five".

Divisors: 1 5 11 55 769 2399 3845 8459 11995 26389 42295 131945 1844831 9224155 20293141 101465705