Base | Representation |
---|---|
bin | 101111011010010… |
… | …000001001000101 |
3 | 2001102201001210011 |
4 | 233122100021011 |
5 | 3112111123023 |
6 | 210532230221 |
7 | 25465611355 |
oct | 5732201105 |
9 | 2042631704 |
10 | 795411013 |
11 | 378a97081 |
12 | 1a246b371 |
13 | c8a37207 |
14 | 778d2b65 |
15 | 49c6c50d |
hex | 2f690245 |
795411013 has 2 divisors, whose sum is σ = 795411014. Its totient is φ = 795411012.
The previous prime is 795411007. The next prime is 795411031. The reversal of 795411013 is 310114597.
Together with next prime (795411031) 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., 732081249 + 63329764 = 27057^2 + 7958^2 .
It is a cyclic number.
It is not a de Polignac number, because 795411013 - 213 = 795402821 is a prime.
It is equal to p40922257 and since 795411013 and 40922257 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 (795411053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 397705506 + 397705507.
It is an arithmetic number, because the mean of its divisors is an integer number (397705507).
Almost surely, 2795411013 is an apocalyptic number.
It is an amenable number.
795411013 is a deficient number, since it is larger than the sum of its proper divisors (1).
795411013 is an equidigital number, since it uses as much as digits as its factorization.
795411013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3780, while the sum is 31.
The square root of 795411013 is about 28203.0319823951. The cubic root of 795411013 is about 926.5393459950.
The spelling of 795411013 in words is "seven hundred ninety-five million, four hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •