Base | Representation |
---|---|
bin | 11010101011101101… |
… | …10000110111010001 |
3 | 1100222100121201022201 |
4 | 31111312300313101 |
5 | 213314240234134 |
6 | 10325253203201 |
7 | 1014665135515 |
oct | 152566606721 |
9 | 40870551281 |
10 | 14325321169 |
11 | 60912a7905 |
12 | 2939630501 |
13 | 1473b34103 |
14 | 99c79c145 |
15 | 58c994914 |
hex | 355db0dd1 |
14325321169 has 2 divisors, whose sum is σ = 14325321170. Its totient is φ = 14325321168.
The previous prime is 14325321083. The next prime is 14325321229. The reversal of 14325321169 is 96112352341.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11775071169 + 2550250000 = 108513^2 + 50500^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14325321169 is a prime.
It is a super-2 number, since 2×143253211692 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (14325321869) 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 as a sum of consecutive naturals, namely, 7162660584 + 7162660585.
It is an arithmetic number, because the mean of its divisors is an integer number (7162660585).
Almost surely, 214325321169 is an apocalyptic number.
It is an amenable number.
14325321169 is a deficient number, since it is larger than the sum of its proper divisors (1).
14325321169 is an equidigital number, since it uses as much as digits as its factorization.
14325321169 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 38880, while the sum is 37.
The spelling of 14325321169 in words is "fourteen billion, three hundred twenty-five million, three hundred twenty-one thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •