Base | Representation |
---|---|
bin | 1001011111101000010… |
… | …00011100001111100100 |
3 | 1011012000201110210011101 |
4 | 10233310020130033210 |
5 | 20321043402310430 |
6 | 405510200245444 |
7 | 32365665440431 |
oct | 4576410341744 |
9 | 1135021423141 |
10 | 326218400740 |
11 | 116391867891 |
12 | 53281a70884 |
13 | 249ba8ccabb |
14 | 11b09248b88 |
15 | 8744303dca |
hex | 4bf421c3e4 |
326218400740 has 12 divisors (see below), whose sum is σ = 685058641596. Its totient is φ = 130487360288.
The previous prime is 326218400737. The next prime is 326218400741. The reversal of 326218400740 is 47004812623.
It can be written as a sum of positive squares in 2 ways, for example, as 216626946624 + 109591454116 = 465432^2 + 331046^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 326218400740.
It is not an unprimeable number, because it can be changed into a prime (326218400741) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8155459999 + ... + 8155460038.
It is an arithmetic number, because the mean of its divisors is an integer number (57088220133).
Almost surely, 2326218400740 is an apocalyptic number.
It is an amenable number.
326218400740 is an abundant number, since it is smaller than the sum of its proper divisors (358840240856).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
326218400740 is a wasteful number, since it uses less digits than its factorization.
326218400740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16310920046 (or 16310920044 counting only the distinct ones).
The product of its (nonzero) digits is 64512, while the sum is 37.
The spelling of 326218400740 in words is "three hundred twenty-six billion, two hundred eighteen million, four hundred thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •