Base | Representation |
---|---|
bin | 1001010110000000111… |
… | …00101101010111100000 |
3 | 1010200200222010111000211 |
4 | 10223000130231113200 |
5 | 20230010410044412 |
6 | 403254035223504 |
7 | 32124034534210 |
oct | 4530034552740 |
9 | 1120628114024 |
10 | 321056331232 |
11 | 114182a2463a |
12 | 52281147b94 |
13 | 243773077c0 |
14 | 1177983a240 |
15 | 8541036ca7 |
hex | 4ac072d5e0 |
321056331232 has 48 divisors (see below), whose sum is σ = 777944194272. Its totient is φ = 127011294720.
The previous prime is 321056331221. The next prime is 321056331263. The reversal of 321056331232 is 232133650123.
It is a junction number, because it is equal to n+sod(n) for n = 321056331194 and 321056331203.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 55123519 + ... + 55129342.
It is an arithmetic number, because the mean of its divisors is an integer number (16207170714).
Almost surely, 2321056331232 is an apocalyptic number.
321056331232 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
321056331232 is an abundant number, since it is smaller than the sum of its proper divisors (456887863040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
321056331232 is a wasteful number, since it uses less digits than its factorization.
321056331232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110252891 (or 110252883 counting only the distinct ones).
The product of its (nonzero) digits is 19440, while the sum is 31.
Adding to 321056331232 its reverse (232133650123), we get a palindrome (553189981355).
The spelling of 321056331232 in words is "three hundred twenty-one billion, fifty-six million, three hundred thirty-one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •