Base | Representation |
---|---|
bin | 11001000010100000… |
… | …00011111110111101 |
3 | 1021200211220222212121 |
4 | 30201100003332331 |
5 | 210012321320022 |
6 | 10101525002541 |
7 | 654060402655 |
oct | 144120037675 |
9 | 37624828777 |
10 | 13442760637 |
11 | 57790a7039 |
12 | 2731b53451 |
13 | 1363035547 |
14 | 9174a1365 |
15 | 53a2602c7 |
hex | 321403fbd |
13442760637 has 2 divisors, whose sum is σ = 13442760638. Its totient is φ = 13442760636.
The previous prime is 13442760631. The next prime is 13442760679. The reversal of 13442760637 is 73606724431.
13442760637 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 can be written as a sum of positive squares in only one way, i.e., 12889287961 + 553472676 = 113531^2 + 23526^2 .
It is a cyclic number.
It is not a de Polignac number, because 13442760637 - 231 = 11295276989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13442760593 and 13442760602.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13442760631) 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, 6721380318 + 6721380319.
It is an arithmetic number, because the mean of its divisors is an integer number (6721380319).
Almost surely, 213442760637 is an apocalyptic number.
It is an amenable number.
13442760637 is a deficient number, since it is larger than the sum of its proper divisors (1).
13442760637 is an equidigital number, since it uses as much as digits as its factorization.
13442760637 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 508032, while the sum is 43.
The spelling of 13442760637 in words is "thirteen billion, four hundred forty-two million, seven hundred sixty thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •