Base | Representation |
---|---|
bin | 110000000001100… |
… | …011100001100011 |
3 | 2002011002111211222 |
4 | 300001203201203 |
5 | 3122230322034 |
6 | 211541125255 |
7 | 25652312315 |
oct | 6001434143 |
9 | 2064074758 |
10 | 805714019 |
11 | 383893960 |
12 | 1a59b982b |
13 | cac03976 |
14 | 790157b5 |
15 | 4ab0512e |
hex | 30063863 |
805714019 has 8 divisors (see below), whose sum is σ = 925222080. Its totient is φ = 693916200.
The previous prime is 805714009. The next prime is 805714037. The reversal of 805714019 is 910417508.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 805714019 - 212 = 805709923 is a prime.
It is a super-2 number, since 2×8057140192 = 1298350160826264722, which contains 22 as substring.
It is a Duffinian number.
It is a zygodrome in base 2.
It is a self number, because there is not a number n which added to its sum of digits gives 805714019.
It is not an unprimeable number, because it can be changed into a prime (805714009) 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 in 7 ways as a sum of consecutive naturals, for example, 1927337 + ... + 1927754.
It is an arithmetic number, because the mean of its divisors is an integer number (115652760).
Almost surely, 2805714019 is an apocalyptic number.
805714019 is a deficient number, since it is larger than the sum of its proper divisors (119508061).
805714019 is a wasteful number, since it uses less digits than its factorization.
805714019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3855121.
The product of its (nonzero) digits is 10080, while the sum is 35.
The square root of 805714019 is about 28385.1020607642. The cubic root of 805714019 is about 930.5227026549.
The spelling of 805714019 in words is "eight hundred five million, seven hundred fourteen thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •