Base | Representation |
---|---|
bin | 110000011110001… |
… | …000110101011011 |
3 | 2002200012012010011 |
4 | 300132020311123 |
5 | 3131140110000 |
6 | 212405502351 |
7 | 26103100345 |
oct | 6036106533 |
9 | 2080165104 |
10 | 813206875 |
11 | 3880413a8 |
12 | 1a84119b7 |
13 | cc628300 |
14 | 7a006295 |
15 | 4b5d52ba |
hex | 30788d5b |
813206875 has 30 divisors (see below), whose sum is σ = 1100507100. Its totient is φ = 600444000.
The previous prime is 813206861. The next prime is 813206879. The reversal of 813206875 is 578602318.
813206875 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 813206875 - 29 = 813206363 is a prime.
It is a super-3 number, since 3×8132068753 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a hoax number, since the sum of its digits (40) coincides with the sum of the digits of its distinct prime factors.
It is not an unprimeable number, because it can be changed into a prime (813206879) by changing a digit.
It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 101776 + ... + 109474.
It is an arithmetic number, because the mean of its divisors is an integer number (36683570).
Almost surely, 2813206875 is an apocalyptic number.
813206875 is a deficient number, since it is larger than the sum of its proper divisors (287300225).
813206875 is an equidigital number, since it uses as much as digits as its factorization.
813206875 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7745 (or 7717 counting only the distinct ones).
The product of its (nonzero) digits is 80640, while the sum is 40.
The square root of 813206875 is about 28516.7823395277. The cubic root of 813206875 is about 933.3983178250.
The spelling of 813206875 in words is "eight hundred thirteen million, two hundred six thousand, eight hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •