Search a number
-
+
14096915051 = 29486100519
BaseRepresentation
bin11010010000011110…
…11101101001101011
31100101102211111000212
431020033131221223
5212332302240201
610250453451335
71006222541462
oct151017355153
940342744025
1014096915051
115a84382a1a
122895040b4b
13143871246b
1497a3039d9
155778c8abb
hex3483dda6b

14096915051 has 4 divisors (see below), whose sum is σ = 14583015600. Its totient is φ = 13610814504.

The previous prime is 14096915047. The next prime is 14096915069. The reversal of 14096915051 is 15051969041.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 14096915051 - 22 = 14096915047 is a prime.

It is a super-2 number, since 2×140969150512 (a number of 21 digits) contains 22 as substring.

It is a Duffinian number.

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

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

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

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

Almost surely, 214096915051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 486100548.

The product of its (nonzero) digits is 48600, while the sum is 41.

The spelling of 14096915051 in words is "fourteen billion, ninety-six million, nine hundred fifteen thousand, fifty-one".

Divisors: 1 29 486100519 14096915051