Base | Representation |
---|---|
bin | 110000010110111… |
… | …001100001001101 |
3 | 2002112121202220102 |
4 | 300112321201031 |
5 | 3130143343013 |
6 | 212301100445 |
7 | 26051004515 |
oct | 6026714115 |
9 | 2075552812 |
10 | 811309133 |
11 | 386a65618 |
12 | 1a7857725 |
13 | cc11259b |
14 | 79a70845 |
15 | 4b35cd58 |
hex | 305b984d |
811309133 has 8 divisors (see below), whose sum is σ = 839657880. Its totient is φ = 782985280.
The previous prime is 811309129. The next prime is 811309157. The reversal of 811309133 is 331903118.
It can be written as a sum of positive squares in 4 ways, for example, as 104919049 + 706390084 = 10243^2 + 26578^2 .
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 811309133 - 22 = 811309129 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a junction number, because it is equal to n+sod(n) for n = 811309096 and 811309105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (811309193) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 81023 + ... + 90483.
It is an arithmetic number, because the mean of its divisors is an integer number (104957235).
Almost surely, 2811309133 is an apocalyptic number.
It is an amenable number.
811309133 is a deficient number, since it is larger than the sum of its proper divisors (28348747).
811309133 is a wasteful number, since it uses less digits than its factorization.
811309133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12447.
The product of its (nonzero) digits is 1944, while the sum is 29.
The square root of 811309133 is about 28483.4887785889. The cubic root of 811309133 is about 932.6716766146.
The spelling of 811309133 in words is "eight hundred eleven million, three hundred nine thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •