Search a number
-
+
14507261029 = 17981046151
BaseRepresentation
bin11011000001011001…
…10011110001100101
31101110000222012220001
431200230303301211
5214202324323104
610355312541301
71022334453442
oct154054636145
941400865801
1014507261029
116174a74a28
12298a551831
1314a2736c31
149b89dc9c9
1559d932aa4
hex360b33c65

14507261029 has 4 divisors (see below), whose sum is σ = 14588307360. Its totient is φ = 14426214700.

The previous prime is 14507261023. The next prime is 14507261039. The reversal of 14507261029 is 92016270541.

14507261029 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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 a cyclic number.

It is not a de Polignac number, because 14507261029 - 25 = 14507260997 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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, 40522897 + ... + 40523254.

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

Almost surely, 214507261029 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 81046330.

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

The spelling of 14507261029 in words is "fourteen billion, five hundred seven million, two hundred sixty-one thousand, twenty-nine".

Divisors: 1 179 81046151 14507261029