Base | Representation |
---|---|
bin | 1011000110101110111111… |
… | …0011011110000011110001 |
3 | 1121020021222012211110121011 |
4 | 2301223233303132003301 |
5 | 3100023213444133241 |
6 | 41545202124030521 |
7 | 2400111056046331 |
oct | 261535763360361 |
9 | 47207865743534 |
10 | 12210320302321 |
11 | 3988405540979 |
12 | 1452537692441 |
13 | 6a7574b84c0b |
14 | 302da859d0c1 |
15 | 162942422281 |
hex | b1aefcde0f1 |
12210320302321 has 8 divisors (see below), whose sum is σ = 12271832552000. Its totient is φ = 12148809591600.
The previous prime is 12210320302289. The next prime is 12210320302337. The reversal of 12210320302321 is 12320302301221.
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 12210320302321 - 25 = 12210320302289 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12210320302292 and 12210320302301.
It is not an unprimeable number, because it can be changed into a prime (12210320302121) 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, 17645971 + ... + 18324871.
It is an arithmetic number, because the mean of its divisors is an integer number (1533979069000).
Almost surely, 212210320302321 is an apocalyptic number.
It is an amenable number.
12210320302321 is a deficient number, since it is larger than the sum of its proper divisors (61512249679).
12210320302321 is an equidigital number, since it uses as much as digits as its factorization.
12210320302321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 769479.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 12210320302321 its reverse (12320302301221), we get a palindrome (24530622603542).
The spelling of 12210320302321 in words is "twelve trillion, two hundred ten billion, three hundred twenty million, three hundred two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •