Base | Representation |
---|---|
bin | 100111100010001… |
… | …0010111001100000 |
3 | 10102110002111122101 |
4 | 1033010102321200 |
5 | 10204042313143 |
6 | 335344020144 |
7 | 44605166611 |
oct | 11704227140 |
9 | 3373074571 |
10 | 1326526048 |
11 | 620875721 |
12 | 310301654 |
13 | 181a94973 |
14 | c8267c08 |
15 | 7b6ceb4d |
hex | 4f112e60 |
1326526048 has 48 divisors (see below), whose sum is σ = 2769091920. Its totient is φ = 623374336.
The previous prime is 1326526039. The next prime is 1326526063. The reversal of 1326526048 is 8406256231.
It is a junction number, because it is equal to n+sod(n) for n = 1326525998 and 1326526016.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 553140 + ... + 555532.
It is an arithmetic number, because the mean of its divisors is an integer number (57689415).
Almost surely, 21326526048 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 1326526048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1384545960).
1326526048 is an abundant number, since it is smaller than the sum of its proper divisors (1442565872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1326526048 is a wasteful number, since it uses less digits than its factorization.
1326526048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3439 (or 3431 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 37.
The square root of 1326526048 is about 36421.5052956354. The cubic root of 1326526048 is about 1098.7661228055.
The spelling of 1326526048 in words is "one billion, three hundred twenty-six million, five hundred twenty-six thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •