[go: up one dir, main page]

Search a number
-
+
14539051 = 411013511
BaseRepresentation
bin110111011101…
…100100101011
31000100122211101
4313131210223
512210222201
61235342231
7234402622
oct67354453
930318741
1014539051
11823044a
124a51977
1330208b7
141d066b9
151422d01
hexddd92b

14539051 has 8 divisors (see below), whose sum is σ = 15045408. Its totient is φ = 14040000.

The previous prime is 14539043. The next prime is 14539061. The reversal of 14539051 is 15093541.

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

It is a cyclic number.

It is not a de Polignac number, because 14539051 - 23 = 14539043 is a prime.

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

It is a Duffinian number.

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

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

Almost surely, 214539051 is an apocalyptic number.

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

14539051 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 3653.

The product of its (nonzero) digits is 2700, while the sum is 28.

The square root of 14539051 is about 3813.0107526730. The cubic root of 14539051 is about 244.0686618108.

The spelling of 14539051 in words is "fourteen million, five hundred thirty-nine thousand, fifty-one".

Divisors: 1 41 101 3511 4141 143951 354611 14539051