Base | Representation |
---|---|
bin | 11000011110011110… |
… | …10001111010000111 |
3 | 1020220210021220021021 |
4 | 30033033101322013 |
5 | 203402441100024 |
6 | 10011531532011 |
7 | 643430651665 |
oct | 141717217207 |
9 | 36823256237 |
10 | 13140565639 |
11 | 5633563503 |
12 | 26688ba007 |
13 | 1315549636 |
14 | 8c92b9c35 |
15 | 51d96ade4 |
hex | 30f3d1e87 |
13140565639 has 2 divisors, whose sum is σ = 13140565640. Its totient is φ = 13140565638.
The previous prime is 13140565631. The next prime is 13140565679. The reversal of 13140565639 is 93656504131.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13140565639 - 23 = 13140565631 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13140565595 and 13140565604.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13140565631) 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, 6570282819 + 6570282820.
It is an arithmetic number, because the mean of its divisors is an integer number (6570282820).
Almost surely, 213140565639 is an apocalyptic number.
13140565639 is a deficient number, since it is larger than the sum of its proper divisors (1).
13140565639 is an equidigital number, since it uses as much as digits as its factorization.
13140565639 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 291600, while the sum is 43.
The spelling of 13140565639 in words is "thirteen billion, one hundred forty million, five hundred sixty-five thousand, six hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •