Base | Representation |
---|---|
bin | 11000000101010001100… |
… | …11111010110101010001 |
3 | 2221002211112002012101122 |
4 | 30002220303322311101 |
5 | 102024122232402231 |
6 | 1432044350012025 |
7 | 113532243062162 |
oct | 14025063726521 |
9 | 2832745065348 |
10 | 827465903441 |
11 | 299a20a26551 |
12 | 1144507a7015 |
13 | 60050334848 |
14 | 2c09a005769 |
15 | 167ce70777b |
hex | c0a8cfad51 |
827465903441 has 2 divisors, whose sum is σ = 827465903442. Its totient is φ = 827465903440.
The previous prime is 827465903431. The next prime is 827465903443. The reversal of 827465903441 is 144309564728.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 803749903441 + 23716000000 = 896521^2 + 154000^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-827465903441 is a prime.
Together with 827465903443, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (827465903443) 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, 413732951720 + 413732951721.
It is an arithmetic number, because the mean of its divisors is an integer number (413732951721).
It is a 1-persistent number, because it is pandigital, but 2⋅827465903441 = 1654931806882 is not.
Almost surely, 2827465903441 is an apocalyptic number.
It is an amenable number.
827465903441 is a deficient number, since it is larger than the sum of its proper divisors (1).
827465903441 is an equidigital number, since it uses as much as digits as its factorization.
827465903441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5806080, while the sum is 53.
The spelling of 827465903441 in words is "eight hundred twenty-seven billion, four hundred sixty-five million, nine hundred three thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •