Base | Representation |
---|---|
bin | 1010000000101… |
… | …10111101111000 |
3 | 12212000122010000 |
4 | 11000112331320 |
5 | 132444331102 |
6 | 12155553000 |
7 | 2036551044 |
oct | 500267570 |
9 | 185018100 |
10 | 83980152 |
11 | 4344a593 |
12 | 2415b760 |
13 | 14524bc9 |
14 | b221024 |
15 | 758d01c |
hex | 5016f78 |
83980152 has 120 divisors (see below), whose sum is σ = 248945400. Its totient is φ = 26446176.
The previous prime is 83980151. The next prime is 83980181. The reversal of 83980152 is 25108938.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (83980151) 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 29 ways as a sum of consecutive naturals, for example, 233749 + ... + 234107.
It is an arithmetic number, because the mean of its divisors is an integer number (2074545).
Almost surely, 283980152 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 83980152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (124472700).
83980152 is an abundant number, since it is smaller than the sum of its proper divisors (164965248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
83980152 is a wasteful number, since it uses less digits than its factorization.
83980152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 415 (or 383 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 36.
The square root of 83980152 is about 9164.0685287704. The cubic root of 83980152 is about 437.9174173447.
The spelling of 83980152 in words is "eighty-three million, nine hundred eighty thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •