Search a number
-
+
14040567 = 33520021
BaseRepresentation
bin110101100011…
…110111110111
3222102100001000
4311203313313
512043244232
61220534343
7230225412
oct65436767
928370030
1014040567
117a1a982
1248513b3
132ba7a38
141c16b79
15137527c
hexd63df7

14040567 has 8 divisors (see below), whose sum is σ = 20800880. Its totient is φ = 9360360.

The previous prime is 14040541. The next prime is 14040569. The reversal of 14040567 is 76504041.

It is not a de Polignac number, because 14040567 - 28 = 14040311 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 520021 = 14040567 / (1 + 4 + 0 + 4 + 0 + 5 + 6 + 7).

It is a Duffinian number.

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

It is a congruent number.

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

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

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

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

Almost surely, 214040567 is an apocalyptic number.

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

14040567 is an equidigital number, since it uses as much as digits as its factorization.

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

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

The product of its (nonzero) digits is 3360, while the sum is 27.

The square root of 14040567 is about 3747.0744588278. The cubic root of 14040567 is about 241.2467929809.

The spelling of 14040567 in words is "fourteen million, forty thousand, five hundred sixty-seven".

Divisors: 1 3 9 27 520021 1560063 4680189 14040567