Search a number
-
+
13640695 = 517915241
BaseRepresentation
bin110100000010…
…001111110111
3221200000111221
4310002033313
511443000240
61204211211
7223641535
oct64021767
927600457
1013640695
117777502
124699b07
132a97a23
141b51155
1512e6a4a
hexd023f7

13640695 has 8 divisors (see below), whose sum is σ = 16461360. Its totient is φ = 10850880.

The previous prime is 13640677. The next prime is 13640699. The reversal of 13640695 is 59604631.

13640695 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

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

It is not a de Polignac number, because 13640695 - 27 = 13640567 is a prime.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (13640699) 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, 6726 + ... + 8515.

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

Almost surely, 213640695 is an apocalyptic number.

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

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

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

The sum of its prime factors is 15425.

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

The square root of 13640695 is about 3693.3311522256. The cubic root of 13640695 is about 238.9344836554.

The spelling of 13640695 in words is "thirteen million, six hundred forty thousand, six hundred ninety-five".

Divisors: 1 5 179 895 15241 76205 2728139 13640695