Base | Representation |
---|---|
bin | 10110111010000… |
… | …101111110111000 |
3 | 222210011212100212 |
4 | 112322011332320 |
5 | 1241341440413 |
6 | 102045250252 |
7 | 12344505440 |
oct | 2672057670 |
9 | 883155325 |
10 | 384327608 |
11 | 187a41025 |
12 | a8863988 |
13 | 61814bb2 |
14 | 39085120 |
15 | 23b19ca8 |
hex | 16e85fb8 |
384327608 has 64 divisors (see below), whose sum is σ = 868008960. Its totient is φ = 155966976.
The previous prime is 384327589. The next prime is 384327641. The reversal of 384327608 is 806723483.
It is a super-3 number, since 3×3843276083 (a number of 27 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 131216 + ... + 134112.
It is an arithmetic number, because the mean of its divisors is an integer number (13562640).
Almost surely, 2384327608 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 384327608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (434004480).
384327608 is an abundant number, since it is smaller than the sum of its proper divisors (483681352).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
384327608 is a wasteful number, since it uses less digits than its factorization.
384327608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3036 (or 3032 counting only the distinct ones).
The product of its (nonzero) digits is 193536, while the sum is 41.
The square root of 384327608 is about 19604.2752480167. The cubic root of 384327608 is about 727.0548808932.
The spelling of 384327608 in words is "three hundred eighty-four million, three hundred twenty-seven thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •