Base | Representation |
---|---|
bin | 100010001000011010… |
… | …010000110101011000 |
3 | 10111121002021202222122 |
4 | 202020122100311120 |
5 | 1100023432340230 |
6 | 24500324440412 |
7 | 2435115421640 |
oct | 421032206530 |
9 | 114532252878 |
10 | 36648324440 |
11 | 145a7029642 |
12 | 7129549108 |
13 | 35c08792a0 |
14 | 1ab93bd520 |
15 | e47627be5 |
hex | 888690d58 |
36648324440 has 128 divisors (see below), whose sum is σ = 102419856000. Its totient is φ = 11492057088.
The previous prime is 36648324421. The next prime is 36648324457. The reversal of 36648324440 is 4442384663.
It is a junction number, because it is equal to n+sod(n) for n = 36648324391 and 36648324400.
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 31 ways as a sum of consecutive naturals, for example, 350576 + ... + 442944.
It is an arithmetic number, because the mean of its divisors is an integer number (800155125).
Almost surely, 236648324440 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 36648324440, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (51209928000).
36648324440 is an abundant number, since it is smaller than the sum of its proper divisors (65771531560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
36648324440 is a wasteful number, since it uses less digits than its factorization.
36648324440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92509 (or 92505 counting only the distinct ones).
The product of its (nonzero) digits is 1327104, while the sum is 44.
The spelling of 36648324440 in words is "thirty-six billion, six hundred forty-eight million, three hundred twenty-four thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •