Base | Representation |
---|---|
bin | 100100011111100110010110… |
… | …0001100100111100011110100 |
3 | 1120002120112001100220110221112 |
4 | 1020333030230030213203310 |
5 | 314033300203333203022 |
6 | 3054414231041534152 |
7 | 124420436203134650 |
oct | 11077145414474364 |
9 | 1502515040813845 |
10 | 321002302241012 |
11 | 93310348114177 |
12 | 30004491644358 |
13 | 10a16505932572 |
14 | 593a846b8da60 |
15 | 271a0171218e2 |
hex | 123f32c3278f4 |
321002302241012 has 12 divisors (see below), whose sum is σ = 642004604482080. Its totient is φ = 137572415246136.
The previous prime is 321002302241011. The next prime is 321002302241029. The reversal of 321002302241012 is 210142203200123.
321002302241012 is an admirable number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (321002302241011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5732183968562 + ... + 5732183968617.
It is an arithmetic number, because the mean of its divisors is an integer number (53500383706840).
Almost surely, 2321002302241012 is an apocalyptic number.
It is an amenable number.
321002302241012 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
321002302241012 is a wasteful number, since it uses less digits than its factorization.
321002302241012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11464367937190 (or 11464367937188 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 321002302241012 its reverse (210142203200123), we get a palindrome (531144505441135).
The spelling of 321002302241012 in words is "three hundred twenty-one trillion, two billion, three hundred two million, two hundred forty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.129 sec. • engine limits •