Base | Representation |
---|---|
bin | 1011000110110001100110… |
… | …1101010001010100000001 |
3 | 1121020100210012200110222212 |
4 | 2301230121231101110001 |
5 | 3100031133432222241 |
6 | 41545400000111505 |
7 | 2400134353440440 |
oct | 261543155212401 |
9 | 47210705613885 |
10 | 12211023320321 |
11 | 3988736361791 |
12 | 14526b3005595 |
13 | 6a765770cbb7 |
14 | 303033ac0d57 |
15 | 162983eddbeb |
hex | b1b19b51501 |
12211023320321 has 8 divisors (see below), whose sum is σ = 14295832180224. Its totient is φ = 10211308699680.
The previous prime is 12211023320303. The next prime is 12211023320333. The reversal of 12211023320321 is 12302332011221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12211023320321 is a prime.
It is not an unprimeable number, because it can be changed into a prime (12211023320341) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 21273559505 + ... + 21273560078.
It is an arithmetic number, because the mean of its divisors is an integer number (1786979022528).
Almost surely, 212211023320321 is an apocalyptic number.
It is an amenable number.
12211023320321 is a deficient number, since it is larger than the sum of its proper divisors (2084808859903).
12211023320321 is an equidigital number, since it uses as much as digits as its factorization.
12211023320321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42547119631.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 12211023320321 its reverse (12302332011221), we get a palindrome (24513355331542).
The spelling of 12211023320321 in words is "twelve trillion, two hundred eleven billion, twenty-three million, three hundred twenty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •