Search a number
-
+
13485597 = 341109639
BaseRepresentation
bin110011011100…
…011000011101
3221101010202120
4303130120131
511423014342
61201013153
7222424416
oct63343035
927333676
1013485597
117680a24
1246241b9
132a42258
141b1080d
1512b5aec
hexcdc61d

13485597 has 8 divisors (see below), whose sum is σ = 18419520. Its totient is φ = 8771040.

The previous prime is 13485587. The next prime is 13485601. The reversal of 13485597 is 79558431.

13485597 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 13485597 - 27 = 13485469 is a prime.

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

It is a congruent number.

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

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

Almost surely, 213485597 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 109683.

The product of its digits is 151200, while the sum is 42.

The square root of 13485597 is about 3672.2740910776. The cubic root of 13485597 is about 238.0254486358.

The spelling of 13485597 in words is "thirteen million, four hundred eighty-five thousand, five hundred ninety-seven".

Divisors: 1 3 41 123 109639 328917 4495199 13485597