Base | Representation |
---|---|
bin | 1011001000111010010… |
… | …10111110100101110100 |
3 | 1100120220220200001112220 |
4 | 11210131022332211310 |
5 | 22232323311201140 |
6 | 451455022442340 |
7 | 36436456061130 |
oct | 5443512764564 |
9 | 1316826601486 |
10 | 382741506420 |
11 | 138357669769 |
12 | 622174333b0 |
13 | 2a127c20570 |
14 | 1474c0363c0 |
15 | 9e516b0bd0 |
hex | 591d2be974 |
382741506420 has 384 divisors, whose sum is σ = 1444741401600. Its totient is φ = 73382658048.
The previous prime is 382741506353. The next prime is 382741506439. The reversal of 382741506420 is 24605147283.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 2620686 + ... + 2762874.
It is an arithmetic number, because the mean of its divisors is an integer number (3762347400).
Almost surely, 2382741506420 is an apocalyptic number.
382741506420 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 382741506420, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (722370700800).
382741506420 is an abundant number, since it is smaller than the sum of its proper divisors (1061999895180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
382741506420 is a wasteful number, since it uses less digits than its factorization.
382741506420 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 142267 (or 142265 counting only the distinct ones).
The product of its (nonzero) digits is 322560, while the sum is 42.
The spelling of 382741506420 in words is "three hundred eighty-two billion, seven hundred forty-one million, five hundred six thousand, four hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •