Base | Representation |
---|---|
bin | 110000011100010… |
… | …001001110101001 |
3 | 2002122021022002111 |
4 | 300130101032221 |
5 | 3131023420334 |
6 | 212351202321 |
7 | 26065660141 |
oct | 6034211651 |
9 | 2078238074 |
10 | 812716969 |
11 | 387837319 |
12 | 1a82163a1 |
13 | cc4b631c |
14 | 79d19921 |
15 | 4b53a064 |
hex | 307113a9 |
812716969 has 8 divisors (see below), whose sum is σ = 830615240. Its totient is φ = 794966400.
The previous prime is 812716921. The next prime is 812716973. The reversal of 812716969 is 969617218.
It can be written as a sum of positive squares in 4 ways, for example, as 245705625 + 567011344 = 15675^2 + 23812^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-812716969 is a prime.
It is a super-2 number, since 2×8127169692 = 1321017743401093922, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (812716979) 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 in 7 ways as a sum of consecutive naturals, for example, 25764 + ... + 47845.
It is an arithmetic number, because the mean of its divisors is an integer number (103826905).
Almost surely, 2812716969 is an apocalyptic number.
It is an amenable number.
812716969 is a deficient number, since it is larger than the sum of its proper divisors (17898271).
812716969 is a wasteful number, since it uses less digits than its factorization.
812716969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73851.
The product of its digits is 326592, while the sum is 49.
The square root of 812716969 is about 28508.1912614603. The cubic root of 812716969 is about 933.2108422441.
The spelling of 812716969 in words is "eight hundred twelve million, seven hundred sixteen thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •