Base | Representation |
---|---|
bin | 11010100100000101… |
… | …00110101111011001 |
3 | 1100210220011221111222 |
4 | 31102002212233121 |
5 | 213201344112234 |
6 | 10315045301425 |
7 | 1013260122263 |
oct | 152202465731 |
9 | 40726157458 |
10 | 14261316569 |
11 | 6059161245 |
12 | 2920104875 |
13 | 14637b4476 |
14 | 99409ab33 |
15 | 58705042e |
hex | 3520a6bd9 |
14261316569 has 2 divisors, whose sum is σ = 14261316570. Its totient is φ = 14261316568.
The previous prime is 14261316547. The next prime is 14261316577. The reversal of 14261316569 is 96561316241.
14261316569 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8611840000 + 5649476569 = 92800^2 + 75163^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14261316569 is a prime.
It is a super-2 number, since 2×142613165692 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (14261316599) 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, 7130658284 + 7130658285.
It is an arithmetic number, because the mean of its divisors is an integer number (7130658285).
Almost surely, 214261316569 is an apocalyptic number.
It is an amenable number.
14261316569 is a deficient number, since it is larger than the sum of its proper divisors (1).
14261316569 is an equidigital number, since it uses as much as digits as its factorization.
14261316569 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 233280, while the sum is 44.
The spelling of 14261316569 in words is "fourteen billion, two hundred sixty-one million, three hundred sixteen thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •