Base | Representation |
---|---|
bin | 10110101111111… |
… | …110010101010000 |
3 | 222121012002102220 |
4 | 112233332111100 |
5 | 1240202043312 |
6 | 101512341040 |
7 | 12313116420 |
oct | 2657762520 |
9 | 877162386 |
10 | 381674832 |
11 | 186499a50 |
12 | a79a4780 |
13 | 610c65c6 |
14 | 38994480 |
15 | 23793c8c |
hex | 16bfe550 |
381674832 has 160 divisors (see below), whose sum is σ = 1262966784. Its totient is φ = 96422400.
The previous prime is 381674819. The next prime is 381674851. The reversal of 381674832 is 238476183.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a nude number because it is divisible by every one of its digits.
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 31 ways as a sum of consecutive naturals, for example, 135357 + ... + 138147.
Almost surely, 2381674832 is an apocalyptic number.
It is a pronic number, being equal to 19536×19537.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 381674832, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (631483392).
381674832 is an abundant number, since it is smaller than the sum of its proper divisors (881291952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
381674832 is a wasteful number, since it uses less digits than its factorization.
381674832 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2857 (or 2851 counting only the distinct ones).
The product of its digits is 193536, while the sum is 42.
The square root of 381674832 is about 19536.4999936017. The cubic root of 381674832 is about 725.3782137592.
The spelling of 381674832 in words is "three hundred eighty-one million, six hundred seventy-four thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •