Base | Representation |
---|---|
bin | 1011000110101110111101… |
… | …1000100000001001111101 |
3 | 1121020021221201112022100020 |
4 | 2301223233120200021331 |
5 | 3100023210141424041 |
6 | 41545201312322353 |
7 | 2400110642004201 |
oct | 261535730401175 |
9 | 47207851468306 |
10 | 12210313233021 |
11 | 3988401552682 |
12 | 14525352433b9 |
13 | 6a757357b2b7 |
14 | 302da767cb01 |
15 | 1629419c7866 |
hex | b1aef62027d |
12210313233021 has 16 divisors (see below), whose sum is σ = 16283843497536. Its totient is φ = 8138496110976.
The previous prime is 12210313232977. The next prime is 12210313233037. The reversal of 12210313233021 is 12033231301221.
It is not a de Polignac number, because 12210313233021 - 217 = 12210313101949 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12210313232982 and 12210313233000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12210313233061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 410788666 + ... + 410818388.
It is an arithmetic number, because the mean of its divisors is an integer number (1017740218596).
Almost surely, 212210313233021 is an apocalyptic number.
It is an amenable number.
12210313233021 is a deficient number, since it is larger than the sum of its proper divisors (4073530264515).
12210313233021 is a wasteful number, since it uses less digits than its factorization.
12210313233021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53932.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 12210313233021 its reverse (12033231301221), we get a palindrome (24243544534242).
The spelling of 12210313233021 in words is "twelve trillion, two hundred ten billion, three hundred thirteen million, two hundred thirty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •