Base | Representation |
---|---|
bin | 1100011110010100011001… |
… | …1111100110100011001001 |
3 | 1210120010211212002211200211 |
4 | 3013211012133212203021 |
5 | 3244201321343444414 |
6 | 45100331244201121 |
7 | 2613606546154525 |
oct | 307450637464311 |
9 | 53503755084624 |
10 | 13715013265609 |
11 | 4408560491017 |
12 | 165608a2391a1 |
13 | 786421637476 |
14 | 355b4b204d85 |
15 | 18bb5b7c43c4 |
hex | c79467e68c9 |
13715013265609 has 2 divisors, whose sum is σ = 13715013265610. Its totient is φ = 13715013265608.
The previous prime is 13715013265561. The next prime is 13715013265631. The reversal of 13715013265609 is 90656231051731.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8649686871225 + 5065326394384 = 2941035^2 + 2250628^2 .
It is a cyclic number.
It is not a de Polignac number, because 13715013265609 - 231 = 13712865781961 is a prime.
It is not a weakly prime, because it can be changed into another prime (13715013265649) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6857506632804 + 6857506632805.
It is an arithmetic number, because the mean of its divisors is an integer number (6857506632805).
Almost surely, 213715013265609 is an apocalyptic number.
It is an amenable number.
13715013265609 is a deficient number, since it is larger than the sum of its proper divisors (1).
13715013265609 is an equidigital number, since it uses as much as digits as its factorization.
13715013265609 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1020600, while the sum is 49.
The spelling of 13715013265609 in words is "thirteen trillion, seven hundred fifteen billion, thirteen million, two hundred sixty-five thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •