Base | Representation |
---|---|
bin | 110010101011100… |
… | …000010000101101 |
3 | 2012020220221111020 |
4 | 302223200100231 |
5 | 3220131441013 |
6 | 220212044353 |
7 | 30033064044 |
oct | 6253402055 |
9 | 2166827436 |
10 | 850265133 |
11 | 3a6a52863 |
12 | 1b89036b9 |
13 | 107201b83 |
14 | 80cd155b |
15 | 4e9a5623 |
hex | 32ae042d |
850265133 has 4 divisors (see below), whose sum is σ = 1133686848. Its totient is φ = 566843420.
The previous prime is 850265089. The next prime is 850265137. The reversal of 850265133 is 331562058.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-850265133 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 850265094 and 850265103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (850265137) 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, 141710853 + ... + 141710858.
It is an arithmetic number, because the mean of its divisors is an integer number (283421712).
Almost surely, 2850265133 is an apocalyptic number.
It is an amenable number.
850265133 is a deficient number, since it is larger than the sum of its proper divisors (283421715).
850265133 is a wasteful number, since it uses less digits than its factorization.
850265133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 283421714.
The product of its (nonzero) digits is 21600, while the sum is 33.
The square root of 850265133 is about 29159.3061131434. The cubic root of 850265133 is about 947.3667179549.
The spelling of 850265133 in words is "eight hundred fifty million, two hundred sixty-five thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •