Base | Representation |
---|---|
bin | 1001111001010… |
… | …00111011100000 |
3 | 12210012002122220 |
4 | 10330220323200 |
5 | 132222131102 |
6 | 12123031040 |
7 | 2025350346 |
oct | 474507340 |
9 | 183162586 |
10 | 83005152 |
11 | 42943aaa |
12 | 2396b480 |
13 | 14273199 |
14 | b049996 |
15 | 74491bc |
hex | 4f28ee0 |
83005152 has 96 divisors (see below), whose sum is σ = 232805664. Its totient is φ = 25804800.
The previous prime is 83005141. The next prime is 83005187. The reversal of 83005152 is 25150038.
It is a tau number, because it is divible by the number of its divisors (96).
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 295252 + ... + 295532.
It is an arithmetic number, because the mean of its divisors is an integer number (2425059).
Almost surely, 283005152 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 83005152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (116402832).
83005152 is an abundant number, since it is smaller than the sum of its proper divisors (149800512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
83005152 is a wasteful number, since it uses less digits than its factorization.
83005152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 492 (or 484 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 24.
The square root of 83005152 is about 9110.7163274904. The cubic root of 83005152 is about 436.2160924158.
The spelling of 83005152 in words is "eighty-three million, five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •