Base | Representation |
---|---|
bin | 100110101000111101000… |
… | …001001100111000110111 |
3 | 100101211211100211120001102 |
4 | 212220331001030320313 |
5 | 322001040224422124 |
6 | 5351500103520315 |
7 | 362561100316304 |
oct | 46507501147067 |
9 | 10354740746042 |
10 | 2655313514039 |
11 | 93412628914a |
12 | 36a74b15909b |
13 | 163519a40134 |
14 | 927370160ab |
15 | 4910de24aae |
hex | 26a3d04ce37 |
2655313514039 has 2 divisors, whose sum is σ = 2655313514040. Its totient is φ = 2655313514038.
The previous prime is 2655313513999. The next prime is 2655313514041. The reversal of 2655313514039 is 9304153135562.
2655313514039 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 is a cyclic number.
It is not a de Polignac number, because 2655313514039 - 228 = 2655045078583 is a prime.
It is a Sophie Germain prime.
Together with 2655313514041, 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 = 2655313513984 and 2655313514002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2655313814039) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1327656757019 + 1327656757020.
It is an arithmetic number, because the mean of its divisors is an integer number (1327656757020).
Almost surely, 22655313514039 is an apocalyptic number.
2655313514039 is a deficient number, since it is larger than the sum of its proper divisors (1).
2655313514039 is an equidigital number, since it uses as much as digits as its factorization.
2655313514039 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1458000, while the sum is 47.
The spelling of 2655313514039 in words is "two trillion, six hundred fifty-five billion, three hundred thirteen million, five hundred fourteen thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •