Search a number
-
+
14306446513 = 47304392479
BaseRepresentation
bin11010101001011101…
…10000110010110001
31100221001002210011101
431110232300302301
5213244422242023
610323340444401
71014345534412
oct152456606261
940831083141
1014306446513
116081686017
122933249701
13146cc55c88
1499a087809
1558aeb71ad
hex354bb0cb1

14306446513 has 4 divisors (see below), whose sum is σ = 14610839040. Its totient is φ = 14002053988.

The previous prime is 14306446507. The next prime is 14306446559. The reversal of 14306446513 is 31564460341.

14306446513 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 14306446513 - 29 = 14306446001 is a prime.

It is a Duffinian number.

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

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

Almost surely, 214306446513 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 304392526.

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

The spelling of 14306446513 in words is "fourteen billion, three hundred six million, four hundred forty-six thousand, five hundred thirteen".

Divisors: 1 47 304392479 14306446513