Base | Representation |
---|---|
bin | 100100100000010011111001… |
… | …0000111101000001101001101 |
3 | 1120002220212111220102020120201 |
4 | 1021000213302013220031031 |
5 | 314041401012144232341 |
6 | 3054531204410413501 |
7 | 124430501054215114 |
oct | 11100476207501515 |
9 | 1502825456366521 |
10 | 321100112102221 |
11 | 9334887a245611 |
12 | 3001b429a31291 |
13 | 10a227c2783c9a |
14 | 5941484dbcc7b |
15 | 271c83de3b331 |
hex | 12409f21e834d |
321100112102221 has 8 divisors (see below), whose sum is σ = 335193894569664. Its totient is φ = 307017405303840.
The previous prime is 321100112102207. The next prime is 321100112102227. The reversal of 321100112102221 is 122201211001123.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 321100112102221 - 27 = 321100112102093 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (321100112102227) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2768858011 + ... + 2768973976.
It is an arithmetic number, because the mean of its divisors is an integer number (41899236821208).
Almost surely, 2321100112102221 is an apocalyptic number.
It is an amenable number.
321100112102221 is a deficient number, since it is larger than the sum of its proper divisors (14093782467443).
321100112102221 is a wasteful number, since it uses less digits than its factorization.
321100112102221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5537834531.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 321100112102221 its reverse (122201211001123), we get a palindrome (443301323103344).
The spelling of 321100112102221 in words is "three hundred twenty-one trillion, one hundred billion, one hundred twelve million, one hundred two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •