Search a number
-
+
14069565 = 335891171
BaseRepresentation
bin110101101010…
…111100111101
3222110210211000
4311222330331
512100211230
61221320513
7230406066
oct65527475
928423730
1014069565
117a3a744
124866139
132bb7cb3
141c2356d
15137db60
hexd6af3d

14069565 has 32 divisors (see below), whose sum is σ = 25315200. Its totient is φ = 7413120.

The previous prime is 14069551. The next prime is 14069581. The reversal of 14069565 is 56596041.

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

It is not a de Polignac number, because 14069565 - 25 = 14069533 is a prime.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11430 + ... + 12600.

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

Almost surely, 214069565 is an apocalyptic number.

14069565 is a gapful number since it is divisible by the number (15) formed by its first and last digit.

It is an amenable number.

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

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

14069565 is an evil number, because the sum of its binary digits is even.

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

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

The square root of 14069565 is about 3750.9418817145. The cubic root of 14069565 is about 241.4127612062.

The spelling of 14069565 in words is "fourteen million, sixty-nine thousand, five hundred sixty-five".

Divisors: 1 3 5 9 15 27 45 89 135 267 445 801 1171 1335 2403 3513 4005 5855 10539 12015 17565 31617 52695 104219 158085 312657 521095 937971 1563285 2813913 4689855 14069565