Base | Representation |
---|---|
bin | 11001001011110011011… |
… | …00100000110101100101 |
3 | 10001201120100022122010202 |
4 | 30211321230200311211 |
5 | 103134144003412334 |
6 | 1501305512000245 |
7 | 116342454550016 |
oct | 14457154406545 |
9 | 3051510278122 |
10 | 865330138469 |
11 | 303a91338775 |
12 | 11b859390085 |
13 | 637a5a86244 |
14 | 2dc4ca9700d |
15 | 1779896017e |
hex | c979b20d65 |
865330138469 has 2 divisors, whose sum is σ = 865330138470. Its totient is φ = 865330138468.
The previous prime is 865330138451. The next prime is 865330138483. The reversal of 865330138469 is 964831033568.
865330138469 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., 828336616900 + 36993521569 = 910130^2 + 192337^2 .
It is a cyclic number.
It is not a de Polignac number, because 865330138469 - 220 = 865329089893 is a prime.
It is a super-2 number, since 2×8653301384692 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (865330138489) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 432665069234 + 432665069235.
It is an arithmetic number, because the mean of its divisors is an integer number (432665069235).
Almost surely, 2865330138469 is an apocalyptic number.
It is an amenable number.
865330138469 is a deficient number, since it is larger than the sum of its proper divisors (1).
865330138469 is an equidigital number, since it uses as much as digits as its factorization.
865330138469 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 11197440, while the sum is 56.
The spelling of 865330138469 in words is "eight hundred sixty-five billion, three hundred thirty million, one hundred thirty-eight thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •