Base | Representation |
---|---|
bin | 1001111010001… |
… | …11110011110000 |
3 | 12210102112011100 |
4 | 10331013303300 |
5 | 132240203012 |
6 | 12125444400 |
7 | 2026415163 |
oct | 475076360 |
9 | 183375140 |
10 | 83131632 |
11 | 42a20031 |
12 | 23a10700 |
13 | 142b891c |
14 | b07dada |
15 | 74718dc |
hex | 4f47cf0 |
83131632 has 120 divisors (see below), whose sum is σ = 255050640. Its totient is φ = 25159680.
The previous prime is 83131627. The next prime is 83131639. The reversal of 83131632 is 23613138.
It is a happy number.
It is a nude number because it is divisible by every one of its digits.
It is a junction number, because it is equal to n+sod(n) for n = 83131596 and 83131605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (83131639) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 70407 + ... + 71577.
It is an arithmetic number, because the mean of its divisors is an integer number (2125422).
Almost surely, 283131632 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 83131632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (127525320).
83131632 is an abundant number, since it is smaller than the sum of its proper divisors (171919008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
83131632 is a wasteful number, since it uses less digits than its factorization.
83131632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1231 (or 1222 counting only the distinct ones).
The product of its digits is 2592, while the sum is 27.
The square root of 83131632 is about 9117.6549616664. The cubic root of 83131632 is about 436.4375429742.
The spelling of 83131632 in words is "eighty-three million, one hundred thirty-one thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •