Base | Representation |
---|---|
bin | 1001010110010011101… |
… | …10010000100111000100 |
3 | 1010201002221212010000121 |
4 | 10223021312100213010 |
5 | 20230321242233012 |
6 | 403321431151324 |
7 | 32130661104241 |
oct | 4531166204704 |
9 | 1121087763017 |
10 | 321214024132 |
11 | 114253a40651 |
12 | 52305b15544 |
13 | 243a0b9b101 |
14 | 117927685c8 |
15 | 854ecd5a07 |
hex | 4ac9d909c4 |
321214024132 has 12 divisors (see below), whose sum is σ = 595190691900. Its totient is φ = 151159540736.
The previous prime is 321214024097. The next prime is 321214024139. The reversal of 321214024132 is 231420412123.
It can be written as a sum of positive squares in 2 ways, for example, as 156739977216 + 164474046916 = 395904^2 + 405554^2 .
It is a junction number, because it is equal to n+sod(n) for n = 321214024097 and 321214024106.
It is not an unprimeable number, because it can be changed into a prime (321214024139) 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, 2361867757 + ... + 2361867892.
It is an arithmetic number, because the mean of its divisors is an integer number (49599224325).
Almost surely, 2321214024132 is an apocalyptic number.
It is an amenable number.
321214024132 is a deficient number, since it is larger than the sum of its proper divisors (273976667768).
321214024132 is a wasteful number, since it uses less digits than its factorization.
321214024132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4723735670 (or 4723735668 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 321214024132 its reverse (231420412123), we get a palindrome (552634436255).
The spelling of 321214024132 in words is "three hundred twenty-one billion, two hundred fourteen million, twenty-four thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •