Base | Representation |
---|---|
bin | 10111101001111101011… |
… | …01110010101111010001 |
3 | 2212200222111111110100212 |
4 | 23310332231302233101 |
5 | 101304104024320031 |
6 | 1421221242253505 |
7 | 112502652411524 |
oct | 13647655625721 |
9 | 2780874443325 |
10 | 812801010641 |
11 | 293785a87534 |
12 | 1116394b7295 |
13 | 5b854059099 |
14 | 2b4a84d2bbb |
15 | 1622203912b |
hex | bd3eb72bd1 |
812801010641 has 2 divisors, whose sum is σ = 812801010642. Its totient is φ = 812801010640.
The previous prime is 812801010559. The next prime is 812801010643. The reversal of 812801010641 is 146010108218.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 788712729025 + 24088281616 = 888095^2 + 155204^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-812801010641 is a prime.
Together with 812801010643, 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 = 812801010598 and 812801010607.
It is not a weakly prime, because it can be changed into another prime (812801010643) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 406400505320 + 406400505321.
It is an arithmetic number, because the mean of its divisors is an integer number (406400505321).
Almost surely, 2812801010641 is an apocalyptic number.
It is an amenable number.
812801010641 is a deficient number, since it is larger than the sum of its proper divisors (1).
812801010641 is an equidigital number, since it uses as much as digits as its factorization.
812801010641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3072, while the sum is 32.
Adding to 812801010641 its reverse (146010108218), we get a palindrome (958811118859).
The spelling of 812801010641 in words is "eight hundred twelve billion, eight hundred one million, ten thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •