Base | Representation |
---|---|
bin | 11001010001101011100… |
… | …01100110100111011101 |
3 | 10002000201020212011011022 |
4 | 30220311301212213131 |
5 | 103212124302330334 |
6 | 1502550552133525 |
7 | 116513611464431 |
oct | 14506561464735 |
9 | 3060636764138 |
10 | 868485589469 |
11 | 305360523813 |
12 | 12039a0972a5 |
13 | 63b89727804 |
14 | 3006bba69c1 |
15 | 178d09ad82e |
hex | ca35c669dd |
868485589469 has 2 divisors, whose sum is σ = 868485589470. Its totient is φ = 868485589468.
The previous prime is 868485589403. The next prime is 868485589507. The reversal of 868485589469 is 964985584868.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 730105309444 + 138380280025 = 854462^2 + 371995^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-868485589469 is a prime.
It is a super-2 number, since 2×8684855894692 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 868485589393 and 868485589402.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (868485589969) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 434242794734 + 434242794735.
It is an arithmetic number, because the mean of its divisors is an integer number (434242794735).
Almost surely, 2868485589469 is an apocalyptic number.
It is an amenable number.
868485589469 is a deficient number, since it is larger than the sum of its proper divisors (1).
868485589469 is an equidigital number, since it uses as much as digits as its factorization.
868485589469 is an evil number, because the sum of its binary digits is even.
The product of its digits is 4777574400, while the sum is 80.
The spelling of 868485589469 in words is "eight hundred sixty-eight billion, four hundred eighty-five million, five hundred eighty-nine thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •