Base | Representation |
---|---|
bin | 1001100000101000011… |
… | …10011000101110111100 |
3 | 1011020102020121211110000 |
4 | 10300110032120232330 |
5 | 20323144222031030 |
6 | 410035432514300 |
7 | 32415224141436 |
oct | 4602416305674 |
9 | 1136366554400 |
10 | 326756830140 |
11 | 116638791864 |
12 | 533b224b990 |
13 | 24a7531b890 |
14 | 11b5a965656 |
15 | 877670d860 |
hex | 4c14398bbc |
326756830140 has 480 divisors, whose sum is σ = 1123398460800. Its totient is φ = 79024896000.
The previous prime is 326756830093. The next prime is 326756830151. The reversal of 326756830140 is 41038657623.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 316931425 + ... + 316932455.
It is an arithmetic number, because the mean of its divisors is an integer number (2340413460).
Almost surely, 2326756830140 is an apocalyptic number.
326756830140 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 326756830140, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (561699230400).
326756830140 is an abundant number, since it is smaller than the sum of its proper divisors (796641630660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
326756830140 is a wasteful number, since it uses less digits than its factorization.
326756830140 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1315 (or 1304 counting only the distinct ones).
The product of its (nonzero) digits is 725760, while the sum is 45.
The spelling of 326756830140 in words is "three hundred twenty-six billion, seven hundred fifty-six million, eight hundred thirty thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •