Search a number
-
+
14119912630 = 251411991263
BaseRepresentation
bin11010010011001110…
…01100010010110110
31100110001002212210001
431021213030102312
5212404144201010
610253034421514
71006622164015
oct151147142266
940401085701
1014119912630
115a9636038a
1228a089189a
1314404050b5
1497d3aca7c
1557991cc3a
hex3499cc4b6

14119912630 has 8 divisors (see below), whose sum is σ = 25415842752. Its totient is φ = 5647965048.

The previous prime is 14119912621. The next prime is 14119912661. The reversal of 14119912630 is 3621991141.

14119912630 is digitally balanced in base 2, because in such base 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 a self number, because there is not a number n which added to its sum of digits gives 14119912630.

It is a congruent number.

It is an unprimeable number.

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

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

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

Almost surely, 214119912630 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 1411991270.

The product of its (nonzero) digits is 11664, while the sum is 37.

The spelling of 14119912630 in words is "fourteen billion, one hundred nineteen million, nine hundred twelve thousand, six hundred thirty".

Divisors: 1 2 5 10 1411991263 2823982526 7059956315 14119912630