14055 has 8 divisors (see below), whose sum is σ = 22512. Its totient is φ = 7488.

The previous prime is 14051. The next prime is 14057. The reversal of 14055 is 55041.

14055 = 51^{2} + 52^{2} + ... + 55^{2}.

14055 is nontrivially palindromic in base 4.

14055 is digitally balanced in base 3 and base 6, because in such bases 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 14055 - 2^{2} = 14051 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (15), and also a Moran number because the ratio is a prime number: 937 = 14055 / (1 + 4 + 0 + 5 + 5).

14055 is strictly pandigital in base 6.

It is a plaindrome in base 8.

It is a nialpdrome in base 5 and base 13.

It is a congruent number.

It is an inconsummate number, since it does not exist a number *n* which divided by its sum of digits gives 14055.

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

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

2^{14055} is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 945.

The product of its (nonzero) digits is 100, while the sum is 15.

The square root of 14055 is about 118.5537852622. The cubic root of 14055 is about 24.1329427881.

Adding to 14055 its reverse (55041), we get a palindrome (69096).

The spelling of 14055 in words is "fourteen thousand, fifty-five".

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