Search a number
-
+
14555953 = 15499397
BaseRepresentation
bin110111100001…
…101100110001
31000101112000101
4313201230301
512211242303
61235552401
7234503116
oct67415461
930345011
1014555953
118242115
124a5b701
1330284b9
141d0c90d
151427d1d
hexde1b31

14555953 has 4 divisors (see below), whose sum is σ = 14566900. Its totient is φ = 14545008.

The previous prime is 14555939. The next prime is 14555963. The reversal of 14555953 is 35955541.

It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 35955541 = 337106693.

It can be written as a sum of positive squares in 2 ways, for example, as 1682209 + 12873744 = 1297^2 + 3588^2 .

It is a cyclic number.

It is not a de Polignac number, because 14555953 - 29 = 14555441 is a prime.

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3150 + ... + 6247.

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

Almost surely, 214555953 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 10946.

The product of its digits is 67500, while the sum is 37.

The square root of 14555953 is about 3815.2264677211. The cubic root of 14555953 is about 244.1632037674.

The spelling of 14555953 in words is "fourteen million, five hundred fifty-five thousand, nine hundred fifty-three".

Divisors: 1 1549 9397 14555953