Base | Representation |
---|---|
bin | 1001111011101… |
… | …11010010110101 |
3 | 12210210101222002 |
4 | 10331313102311 |
5 | 132312414013 |
6 | 12133545045 |
7 | 2031155222 |
oct | 475672265 |
9 | 183711862 |
10 | 83326133 |
11 | 43043180 |
12 | 23aa5185 |
13 | 14356307 |
14 | b0d0949 |
15 | 74ae358 |
hex | 4f774b5 |
83326133 has 4 divisors (see below), whose sum is σ = 90901248. Its totient is φ = 75751020.
The previous prime is 83326127. The next prime is 83326141. The reversal of 83326133 is 33162338.
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 not a de Polignac number, because 83326133 - 212 = 83322037 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 83326096 and 83326105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (83325133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3787541 + ... + 3787562.
It is an arithmetic number, because the mean of its divisors is an integer number (22725312).
Almost surely, 283326133 is an apocalyptic number.
It is an amenable number.
83326133 is a deficient number, since it is larger than the sum of its proper divisors (7575115).
83326133 is a wasteful number, since it uses less digits than its factorization.
83326133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7575114.
The product of its digits is 7776, while the sum is 29.
The square root of 83326133 is about 9128.3149047346. The cubic root of 83326133 is about 436.7776518647. Note that the first 3 decimals are identical.
The spelling of 83326133 in words is "eighty-three million, three hundred twenty-six thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •