Base | Representation |
---|---|
bin | 11010101011000101… |
… | …01100100001101011 |
3 | 1100221222201110001222 |
4 | 31111202230201223 |
5 | 213311413414043 |
6 | 10324544332255 |
7 | 1014602335406 |
oct | 152542544153 |
9 | 40858643058 |
10 | 14320060523 |
11 | 608933446a |
12 | 293791408b |
13 | 1472a117c2 |
14 | 99bbccd3d |
15 | 58c2a5d68 |
hex | 3558ac86b |
14320060523 has 2 divisors, whose sum is σ = 14320060524. Its totient is φ = 14320060522.
The previous prime is 14320060519. The next prime is 14320060541. The reversal of 14320060523 is 32506002341.
14320060523 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is an emirp because it is prime and its reverse (32506002341) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14320060523 - 22 = 14320060519 is a prime.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 14320060492 and 14320060501.
It is not a weakly prime, because it can be changed into another prime (14320060553) 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 as a sum of consecutive naturals, namely, 7160030261 + 7160030262.
It is an arithmetic number, because the mean of its divisors is an integer number (7160030262).
Almost surely, 214320060523 is an apocalyptic number.
14320060523 is a deficient number, since it is larger than the sum of its proper divisors (1).
14320060523 is an equidigital number, since it uses as much as digits as its factorization.
14320060523 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320, while the sum is 26.
Adding to 14320060523 its reverse (32506002341), we get a palindrome (46826062864).
The spelling of 14320060523 in words is "fourteen billion, three hundred twenty million, sixty thousand, five hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •