Base | Representation |
---|---|
bin | 110000011110011… |
… | …111110101111001 |
3 | 2002200100222101110 |
4 | 300132133311321 |
5 | 3131201113423 |
6 | 212411510533 |
7 | 26103642162 |
oct | 6036376571 |
9 | 2080328343 |
10 | 813301113 |
11 | 3880a6189 |
12 | 1a8458449 |
13 | cc65c181 |
14 | 7a02c769 |
15 | 4b603193 |
hex | 3079fd79 |
813301113 has 8 divisors (see below), whose sum is σ = 1107474048. Its totient is φ = 530664464.
The previous prime is 813301109. The next prime is 813301121. The reversal of 813301113 is 311103318.
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 813301113 - 22 = 813301109 is a prime.
It is a super-2 number, since 2×8133011132 = 1322917400814077538, which contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 813301113.
It is not an unprimeable number, because it can be changed into a prime (813301123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2883906 + ... + 2884187.
It is an arithmetic number, because the mean of its divisors is an integer number (138434256).
Almost surely, 2813301113 is an apocalyptic number.
It is an amenable number.
813301113 is a deficient number, since it is larger than the sum of its proper divisors (294172935).
813301113 is a wasteful number, since it uses less digits than its factorization.
813301113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5768143.
The product of its (nonzero) digits is 216, while the sum is 21.
The square root of 813301113 is about 28518.4346169280. The cubic root of 813301113 is about 933.4343718706.
The spelling of 813301113 in words is "eight hundred thirteen million, three hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •