Search a number
-
+
14501613 = 37690553
BaseRepresentation
bin110111010100…
…011011101101
31000021202110210
4313110123231
512203022423
61234453033
7234155520
oct67243355
930252423
1014501613
118205305
124a34179
133009849
141cd6bb7
151416b93
hexdd46ed

14501613 has 8 divisors (see below), whose sum is σ = 22097728. Its totient is φ = 8286624.

The previous prime is 14501609. The next prime is 14501633. The reversal of 14501613 is 31610541.

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

It is not a de Polignac number, because 14501613 - 22 = 14501609 is a prime.

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

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 14501613.

It is a congruent number.

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

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

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

Almost surely, 214501613 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 690563.

The product of its (nonzero) digits is 360, while the sum is 21.

The square root of 14501613 is about 3808.0983443183. The cubic root of 14501613 is about 243.8589897866.

The spelling of 14501613 in words is "fourteen million, five hundred one thousand, six hundred thirteen".

Divisors: 1 3 7 21 690553 2071659 4833871 14501613