Search a number
-
+
14320123210 = 251432012321
BaseRepresentation
bin11010101011000101…
…11011110101001010
31100221222211122001201
431111202323311022
5213311422420320
610324545534414
71014603016231
oct152542736512
940858748051
1014320123210
116089377578
12293794440a
131472a341b3
1499bc07b18
1558c2b970a
hex3558bbd4a

14320123210 has 8 divisors (see below), whose sum is σ = 25776221796. Its totient is φ = 5728049280.

The previous prime is 14320123163. The next prime is 14320123211. The reversal of 14320123210 is 1232102341.

It is a happy number.

It can be written as a sum of positive squares in 2 ways, for example, as 14104650169 + 215473041 = 118763^2 + 14679^2 .

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

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

Almost surely, 214320123210 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 1432012328.

The product of its (nonzero) digits is 288, while the sum is 19.

Adding to 14320123210 its reverse (1232102341), we get a palindrome (15552225551).

The spelling of 14320123210 in words is "fourteen billion, three hundred twenty million, one hundred twenty-three thousand, two hundred ten".

Divisors: 1 2 5 10 1432012321 2864024642 7160061605 14320123210