Base | Representation |
---|---|
bin | 100100011011011100… |
… | …010001111110001001 |
3 | 10201221222222011120122 |
4 | 210123130101332021 |
5 | 1120101431313022 |
6 | 25545204233025 |
7 | 2553210620324 |
oct | 443334217611 |
9 | 121858864518 |
10 | 39115104137 |
11 | 1565250274a |
12 | 76b769b775 |
13 | 38c4946a45 |
14 | 1c70c637bb |
15 | 103de90742 |
hex | 91b711f89 |
39115104137 has 2 divisors, whose sum is σ = 39115104138. Its totient is φ = 39115104136.
The previous prime is 39115104103. The next prime is 39115104139. The reversal of 39115104137 is 73140151193.
It is a happy number.
39115104137 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., 22195338361 + 16919765776 = 148981^2 + 130076^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-39115104137 is a prime.
Together with 39115104139, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 39115104097 and 39115104106.
It is not a weakly prime, because it can be changed into another prime (39115104139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 19557552068 + 19557552069.
It is an arithmetic number, because the mean of its divisors is an integer number (19557552069).
Almost surely, 239115104137 is an apocalyptic number.
It is an amenable number.
39115104137 is a deficient number, since it is larger than the sum of its proper divisors (1).
39115104137 is an equidigital number, since it uses as much as digits as its factorization.
39115104137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 11340, while the sum is 35.
The spelling of 39115104137 in words is "thirty-nine billion, one hundred fifteen million, one hundred four thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •