Base | Representation |
---|---|
bin | 110000011000010… |
… | …110010010001001 |
3 | 2002120100002010011 |
4 | 300120112102021 |
5 | 3130243022342 |
6 | 212313151521 |
7 | 26054146342 |
oct | 6030262211 |
9 | 2076302104 |
10 | 811689097 |
11 | 3871a503a |
12 | 1a79bb5a1 |
13 | cc21650b |
14 | 79b2d0c9 |
15 | 4b3d5717 |
hex | 30616489 |
811689097 has 2 divisors, whose sum is σ = 811689098. Its totient is φ = 811689096.
The previous prime is 811689079. The next prime is 811689127. The reversal of 811689097 is 790986118.
Together with previous prime (811689079) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 771506176 + 40182921 = 27776^2 + 6339^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-811689097 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 811689097.
It is not a weakly prime, because it can be changed into another prime (811689007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 405844548 + 405844549.
It is an arithmetic number, because the mean of its divisors is an integer number (405844549).
Almost surely, 2811689097 is an apocalyptic number.
It is an amenable number.
811689097 is a deficient number, since it is larger than the sum of its proper divisors (1).
811689097 is an equidigital number, since it uses as much as digits as its factorization.
811689097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 217728, while the sum is 49.
The square root of 811689097 is about 28490.1578970703. The cubic root of 811689097 is about 932.8172546431.
The spelling of 811689097 in words is "eight hundred eleven million, six hundred eighty-nine thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •