Base | Representation |
---|---|
bin | 110000100000011… |
… | …011011011000101 |
3 | 2002201022200202011 |
4 | 300200123123011 |
5 | 3131313313201 |
6 | 212430414221 |
7 | 26111151016 |
oct | 6040333305 |
9 | 2081280664 |
10 | 813807301 |
11 | 38841151a |
12 | 1a8661371 |
13 | cc7a86a8 |
14 | 7a12100d |
15 | 4b6a3151 |
hex | 3081b6c5 |
813807301 has 4 divisors (see below), whose sum is σ = 813883852. Its totient is φ = 813730752.
The previous prime is 813807299. The next prime is 813807307. The reversal of 813807301 is 103708318.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 678550401 + 135256900 = 26049^2 + 11630^2 .
It is a cyclic number.
It is not a de Polignac number, because 813807301 - 21 = 813807299 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (813807307) 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 3 ways as a sum of consecutive naturals, for example, 19140 + ... + 44653.
It is an arithmetic number, because the mean of its divisors is an integer number (203470963).
Almost surely, 2813807301 is an apocalyptic number.
It is an amenable number.
813807301 is a deficient number, since it is larger than the sum of its proper divisors (76551).
813807301 is a wasteful number, since it uses less digits than its factorization.
813807301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76550.
The product of its (nonzero) digits is 4032, while the sum is 31.
The square root of 813807301 is about 28527.3079872602. The cubic root of 813807301 is about 933.6279841664.
The spelling of 813807301 in words is "eight hundred thirteen million, eight hundred seven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •