Base | Representation |
---|---|
bin | 10101100001010… |
… | …111011000000000 |
3 | 221011102011020002 |
4 | 111201113120000 |
5 | 1214413134112 |
6 | 55454535132 |
7 | 11643012323 |
oct | 2541273000 |
9 | 834364202 |
10 | 361068032 |
11 | 1758a4836 |
12 | a0b074a8 |
13 | 59a5cc30 |
14 | 35d4c7ba |
15 | 21a731c2 |
hex | 15857600 |
361068032 has 80 divisors (see below), whose sum is σ = 822884832. Its totient is φ = 156794880.
The previous prime is 361068013. The next prime is 361068041. The reversal of 361068032 is 230860163.
It is a junction number, because it is equal to n+sod(n) for n = 361067986 and 361068004.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 111557 + ... + 114747.
Almost surely, 2361068032 is an apocalyptic number.
361068032 is a gapful number since it is divisible by the number (32) 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 361068032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (411442416).
361068032 is an abundant number, since it is smaller than the sum of its proper divisors (461816800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
361068032 is a wasteful number, since it uses less digits than its factorization.
361068032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3239 (or 3223 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 29.
The square root of 361068032 is about 19001.7902314492. The cubic root of 361068032 is about 712.0814618741.
The spelling of 361068032 in words is "three hundred sixty-one million, sixty-eight thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •