[go: up one dir, main page]

Search a number
-
+
14485701 = 34828567
BaseRepresentation
bin110111010000…
…100011000101
31000020221122110
4313100203011
512202020301
61234251233
7234061236
oct67204305
930227573
1014485701
1181a435a
124a26b19
133002529
141cd108d
1514120d6
hexdd08c5

14485701 has 4 divisors (see below), whose sum is σ = 19314272. Its totient is φ = 9657132.

The previous prime is 14485687. The next prime is 14485721. The reversal of 14485701 is 10758441.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is not a de Polignac number, because 14485701 - 26 = 14485637 is a prime.

It is a super-2 number, since 2×144857012 = 419671066922802, which contains 22 as substring.

It is a Duffinian number.

It is a congruent number.

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

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

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

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

Almost surely, 214485701 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 4828570.

The product of its (nonzero) digits is 4480, while the sum is 30.

The square root of 14485701 is about 3806.0085391391. The cubic root of 14485701 is about 243.7697651297.

The spelling of 14485701 in words is "fourteen million, four hundred eighty-five thousand, seven hundred one".

Divisors: 1 3 4828567 14485701