Base | Representation |
---|---|
bin | 1001111101000… |
… | …11010111101101 |
3 | 12211010120121121 |
4 | 10332203113231 |
5 | 132334203134 |
6 | 12141500541 |
7 | 2032536451 |
oct | 476432755 |
9 | 184116547 |
10 | 83506669 |
11 | 43156884 |
12 | 23b71751 |
13 | 143ba53c |
14 | b13a661 |
15 | 74e7ab4 |
hex | 4fa35ed |
83506669 has 8 divisors (see below), whose sum is σ = 90809208. Its totient is φ = 76469760.
The previous prime is 83506663. The next prime is 83506673. The reversal of 83506669 is 96660538.
It can be written as a sum of positive squares in 4 ways, for example, as 42380100 + 41126569 = 6510^2 + 6413^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 83506669 - 27 = 83506541 is a prime.
It is a super-2 number, since 2×835066692 = 13946727534951122, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (83506663) 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 7 ways as a sum of consecutive naturals, for example, 65752 + ... + 67009.
It is an arithmetic number, because the mean of its divisors is an integer number (11351151).
Almost surely, 283506669 is an apocalyptic number.
It is an amenable number.
83506669 is a deficient number, since it is larger than the sum of its proper divisors (7302539).
83506669 is a wasteful number, since it uses less digits than its factorization.
83506669 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132815.
The product of its (nonzero) digits is 233280, while the sum is 43.
The square root of 83506669 is about 9138.1983454070. The cubic root of 83506669 is about 437.0928679394.
The spelling of 83506669 in words is "eighty-three million, five hundred six thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •