Base | Representation |
---|---|
bin | 10110001001110… |
… | …110101100000100 |
3 | 221220101101220221 |
4 | 112021312230010 |
5 | 1230122311202 |
6 | 100514234124 |
7 | 12132150100 |
oct | 2611665404 |
9 | 856341827 |
10 | 371682052 |
11 | 180894255 |
12 | a4585944 |
13 | 5c008111 |
14 | 37512900 |
15 | 2296d037 |
hex | 16276b04 |
371682052 has 36 divisors (see below), whose sum is σ = 760891404. Its totient is φ = 158397120.
The previous prime is 371682049. The next prime is 371682079. The reversal of 371682052 is 250286173.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 112021056 + 259660996 = 10584^2 + 16114^2 .
It is a junction number, because it is equal to n+sod(n) for n = 371681999 and 371682017.
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 11 ways as a sum of consecutive naturals, for example, 30238 + ... + 40714.
Almost surely, 2371682052 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 371682052, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (380445702).
371682052 is an abundant number, since it is smaller than the sum of its proper divisors (389209352).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
371682052 is a wasteful number, since it uses less digits than its factorization.
371682052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10676 (or 10667 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 34.
The square root of 371682052 is about 19279.0573421005. The cubic root of 371682052 is about 718.9916775480.
The spelling of 371682052 in words is "three hundred seventy-one million, six hundred eighty-two thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •