Base | Representation |
---|---|
bin | 110001011110011… |
… | …100100111010101 |
3 | 2010211220200021012 |
4 | 301132130213111 |
5 | 3144444040414 |
6 | 214211102005 |
7 | 26366302616 |
oct | 6136344725 |
9 | 2124820235 |
10 | 830065109 |
11 | 396606225 |
12 | 1b1ba1905 |
13 | 102c7b6b3 |
14 | 7c353c0d |
15 | 4cd1533e |
hex | 3179c9d5 |
830065109 has 2 divisors, whose sum is σ = 830065110. Its totient is φ = 830065108.
The previous prime is 830065099. The next prime is 830065111. The reversal of 830065109 is 901560038.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 691532209 + 138532900 = 26297^2 + 11770^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-830065109 is a prime.
Together with 830065111, it forms a pair of twin primes.
It is a Chen prime.
It is equal to p42611594 and since 830065109 and 42611594 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (830065169) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 415032554 + 415032555.
It is an arithmetic number, because the mean of its divisors is an integer number (415032555).
Almost surely, 2830065109 is an apocalyptic number.
It is an amenable number.
830065109 is a deficient number, since it is larger than the sum of its proper divisors (1).
830065109 is an equidigital number, since it uses as much as digits as its factorization.
830065109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6480, while the sum is 32.
The square root of 830065109 is about 28810.8505428077. The cubic root of 830065109 is about 939.8042103919.
The spelling of 830065109 in words is "eight hundred thirty million, sixty-five thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •