Base | Representation |
---|---|
bin | 1001111010001… |
… | …11000010010101 |
3 | 12210102100211012 |
4 | 10331013002111 |
5 | 132240102334 |
6 | 12125422005 |
7 | 2026403024 |
oct | 475070225 |
9 | 183370735 |
10 | 83128469 |
11 | 42a18716 |
12 | 23a0a905 |
13 | 142b7358 |
14 | b07c8bb |
15 | 74709ce |
hex | 4f47095 |
83128469 has 4 divisors (see below), whose sum is σ = 83546400. Its totient is φ = 82710540.
The previous prime is 83128447. The next prime is 83128489. The reversal of 83128469 is 96482138.
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 83128469 - 216 = 83062933 is a prime.
It is a super-3 number, since 3×831284693 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (83128429) 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, 208667 + ... + 209064.
It is an arithmetic number, because the mean of its divisors is an integer number (20886600).
Almost surely, 283128469 is an apocalyptic number.
It is an amenable number.
83128469 is a deficient number, since it is larger than the sum of its proper divisors (417931).
83128469 is a wasteful number, since it uses less digits than its factorization.
83128469 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 417930.
The product of its digits is 82944, while the sum is 41.
The square root of 83128469 is about 9117.4815053281. The cubic root of 83128469 is about 436.4320076987.
The spelling of 83128469 in words is "eighty-three million, one hundred twenty-eight thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •