Base | Representation |
---|---|
bin | 101111011001001… |
… | …011100000001101 |
3 | 2001102011210010102 |
4 | 233121023200031 |
5 | 3112023123434 |
6 | 210522220445 |
7 | 25463330612 |
oct | 5731134015 |
9 | 2042153112 |
10 | 795129869 |
11 | 378914926 |
12 | 1a2354725 |
13 | c8969261 |
14 | 7785c509 |
15 | 49c1407e |
hex | 2f64b80d |
795129869 has 2 divisors, whose sum is σ = 795129870. Its totient is φ = 795129868.
The previous prime is 795129857. The next prime is 795129871. The reversal of 795129869 is 968921597.
795129869 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 686178025 + 108951844 = 26195^2 + 10438^2 .
It is a cyclic number.
It is not a de Polignac number, because 795129869 - 220 = 794081293 is a prime.
It is a super-2 number, since 2×7951298692 = 1264463017151914322, which contains 22 as substring.
Together with 795129871, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (795125869) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 397564934 + 397564935.
It is an arithmetic number, because the mean of its divisors is an integer number (397564935).
Almost surely, 2795129869 is an apocalyptic number.
It is an amenable number.
795129869 is a deficient number, since it is larger than the sum of its proper divisors (1).
795129869 is an equidigital number, since it uses as much as digits as its factorization.
795129869 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2449440, while the sum is 56.
The square root of 795129869 is about 28198.0472550849. The cubic root of 795129869 is about 926.4301690326.
The spelling of 795129869 in words is "seven hundred ninety-five million, one hundred twenty-nine thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •