14641 has 5 divisors (see below), whose sum is σ = 16105. Its totient is φ = 13310.

The previous prime is 14639. The next prime is 14653.

14641 = T_{46} + T_{47} + ... +
T_{56}.

It is a happy number.

The square root of 14641 is 121.

It is a perfect power (a square, a biquadrate), and thus also a powerful number.

14641 is nontrivially palindromic in base 10.

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

It is not a de Polignac number, because 14641 - 2^{1} = 14639 is a prime.

It is a Duffinian number.

It is a nialpdrome in base 11.

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

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

It is a polite number, since it can be written in 4 ways as a sum of consecutive naturals, for example, 1326 + ... + 1336.

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

14641 is a Friedman number, since it can be written as 1*(6+4+1)^4, using all its digits and the basic arithmetic operations.

2^{14641} is an apocalyptic number.

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

14641 is the 121-st square number.

14641 is the 61-st centered octagonal number.

It is an amenable number.

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

14641 is an frugal number, since it uses more digits than its factorization.

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

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

The product of its digits is 96, while the sum is 16.

The cubic root of 14641 is about 24.4637809963.

Multiplying 14641 by its sum of digits (16), we get a 4-th power (234256 = 22^{4}).

The spelling of 14641 in words is "fourteen thousand, six hundred forty-one".

• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •