Base | Representation |
---|---|
bin | 100100100001010101000010… |
… | …1011110001000000101110100 |
3 | 1120010102020122112211122012001 |
4 | 1021002222011132020011310 |
5 | 314101144031420013322 |
6 | 3055115343535105044 |
7 | 124443553146031420 |
oct | 11102520536100564 |
9 | 1503366575748161 |
10 | 321240023204212 |
11 | 933a2146430322 |
12 | 30042575972184 |
13 | 10a32a5babb7b8 |
14 | 59481588a9b80 |
15 | 27212cbe4c827 |
hex | 1242a85788174 |
321240023204212 has 48 divisors (see below), whose sum is σ = 651743250278400. Its totient is φ = 135702254822112.
The previous prime is 321240023204207. The next prime is 321240023204249. The reversal of 321240023204212 is 212402320042123.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 268808248 + ... + 270000655.
It is an arithmetic number, because the mean of its divisors is an integer number (13577984380800).
Almost surely, 2321240023204212 is an apocalyptic number.
It is an amenable number.
321240023204212 is an abundant number, since it is smaller than the sum of its proper divisors (330503227074188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
321240023204212 is a wasteful number, since it uses less digits than its factorization.
321240023204212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 538809220 (or 538809218 counting only the distinct ones).
The product of its (nonzero) digits is 9216, while the sum is 28.
Adding to 321240023204212 its reverse (212402320042123), we get a palindrome (533642343246335).
The spelling of 321240023204212 in words is "three hundred twenty-one trillion, two hundred forty billion, twenty-three million, two hundred four thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •