Base | Representation |
---|---|
bin | 10111011101001011100… |
… | …01100010010000011001 |
3 | 2212001021100111121112002 |
4 | 23232211301202100121 |
5 | 101201031132012421 |
6 | 1414124353330345 |
7 | 112140642623021 |
oct | 13564561422031 |
9 | 2761240447462 |
10 | 805940110361 |
11 | 2908851aa611 |
12 | 1102438669b5 |
13 | 5accc806789 |
14 | 2b017224a81 |
15 | 15e6ea49b0b |
hex | bba5c62419 |
805940110361 has 2 divisors, whose sum is σ = 805940110362. Its totient is φ = 805940110360.
The previous prime is 805940110319. The next prime is 805940110421. The reversal of 805940110361 is 163011049508.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 795273351961 + 10666758400 = 891781^2 + 103280^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-805940110361 is a prime.
It is a super-2 number, since 2×8059401103612 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (805940112361) 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, 402970055180 + 402970055181.
It is an arithmetic number, because the mean of its divisors is an integer number (402970055181).
Almost surely, 2805940110361 is an apocalyptic number.
It is an amenable number.
805940110361 is a deficient number, since it is larger than the sum of its proper divisors (1).
805940110361 is an equidigital number, since it uses as much as digits as its factorization.
805940110361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25920, while the sum is 38.
Adding to 805940110361 its reverse (163011049508), we get a palindrome (968951159869).
The spelling of 805940110361 in words is "eight hundred five billion, nine hundred forty million, one hundred ten thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •