Base | Representation |
---|---|
bin | 1011000110101101110011… |
… | …0101101010011101110001 |
3 | 1121020021011001002122020021 |
4 | 2301223130311222131301 |
5 | 3100022041020012241 |
6 | 41545110400043441 |
7 | 2400100143341011 |
oct | 261533465523561 |
9 | 47207131078207 |
10 | 12210002110321 |
11 | 3988261971584 |
12 | 1452469003581 |
13 | 6a7523c87922 |
14 | 302d78211c41 |
15 | 16292451d0d1 |
hex | b1adcd6a771 |
12210002110321 has 8 divisors (see below), whose sum is σ = 12469919639040. Its totient is φ = 11950090008768.
The previous prime is 12210002110309. The next prime is 12210002110367. The reversal of 12210002110321 is 12301120001221.
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 12210002110321 - 211 = 12210002108273 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12210002110295 and 12210002110304.
It is not an unprimeable number, because it can be changed into a prime (12210002119321) 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, 3363640 + ... + 5977798.
It is an arithmetic number, because the mean of its divisors is an integer number (1558739954880).
Almost surely, 212210002110321 is an apocalyptic number.
It is an amenable number.
12210002110321 is a deficient number, since it is larger than the sum of its proper divisors (259917528719).
12210002110321 is an equidigital number, since it uses as much as digits as its factorization.
12210002110321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2713583.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 12210002110321 its reverse (12301120001221), we get a palindrome (24511122111542).
The spelling of 12210002110321 in words is "twelve trillion, two hundred ten billion, two million, one hundred ten thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •