Base | Representation |
---|---|
bin | 1001010110100001001… |
… | …01010010010011011100 |
3 | 1010201101211110122112110 |
4 | 10223100211102103130 |
5 | 20231034203441012 |
6 | 403340545034020 |
7 | 32133532364124 |
oct | 4532045222334 |
9 | 1121354418473 |
10 | 321327015132 |
11 | 1143017a5442 |
12 | 52337925910 |
13 | 243bb40c9a6 |
14 | 117a377bc84 |
15 | 8559ba473c |
hex | 4ad09524dc |
321327015132 has 12 divisors (see below), whose sum is σ = 749763035336. Its totient is φ = 107109005040.
The previous prime is 321327015131. The next prime is 321327015157. The reversal of 321327015132 is 231510723123.
It is a tau number, because it is divible by the number of its divisors (12).
It is a self number, because there is not a number n which added to its sum of digits gives 321327015132.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (321327015131) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 13388625619 + ... + 13388625642.
Almost surely, 2321327015132 is an apocalyptic number.
It is an amenable number.
321327015132 is an abundant number, since it is smaller than the sum of its proper divisors (428436020204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
321327015132 is a wasteful number, since it uses less digits than its factorization.
321327015132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26777251268 (or 26777251266 counting only the distinct ones).
The product of its (nonzero) digits is 7560, while the sum is 30.
Adding to 321327015132 its reverse (231510723123), we get a palindrome (552837738255).
The spelling of 321327015132 in words is "three hundred twenty-one billion, three hundred twenty-seven million, fifteen thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •