Base | Representation |
---|---|
bin | 10011011100001… |
… | …011101111100000 |
3 | 211201201101212102 |
4 | 103130023233200 |
5 | 1131443431412 |
6 | 52210345532 |
7 | 11040162614 |
oct | 2334135740 |
9 | 751641772 |
10 | 326155232 |
11 | 158119287 |
12 | 9128b2a8 |
13 | 52757a80 |
14 | 31461344 |
15 | 1d9788c2 |
hex | 1370bbe0 |
326155232 has 48 divisors (see below), whose sum is σ = 693181440. Its totient is φ = 150170112.
The previous prime is 326155211. The next prime is 326155241. The reversal of 326155232 is 232551623.
It is a junction number, because it is equal to n+sod(n) for n = 326155195 and 326155204.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 254369 + ... + 255647.
It is an arithmetic number, because the mean of its divisors is an integer number (14441280).
Almost surely, 2326155232 is an apocalyptic number.
326155232 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 326155232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (346590720).
326155232 is an abundant number, since it is smaller than the sum of its proper divisors (367026208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
326155232 is a wasteful number, since it uses less digits than its factorization.
326155232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1915 (or 1907 counting only the distinct ones).
The product of its digits is 10800, while the sum is 29.
The square root of 326155232 is about 18059.7683263103. The cubic root of 326155232 is about 688.3480976899.
The spelling of 326155232 in words is "three hundred twenty-six million, one hundred fifty-five thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •