Base | Representation |
---|---|
bin | 1011000110101110010010… |
… | …0001011011010101111111 |
3 | 1121020021111000200002111111 |
4 | 2301223210201123111333 |
5 | 3100022322020220411 |
6 | 41545131243102451 |
7 | 2400103300153261 |
oct | 261534441332577 |
9 | 47207430602444 |
10 | 12210131023231 |
11 | 3988318710779 |
12 | 14524a4211a27 |
13 | 6a75448b265b |
14 | 302d8b3abb31 |
15 | 1629309d4721 |
hex | b1ae485b57f |
12210131023231 has 8 divisors (see below), whose sum is σ = 12452370310800. Its totient is φ = 11968330974912.
The previous prime is 12210131023177. The next prime is 12210131023249. The reversal of 12210131023231 is 13232013101221.
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 12210131023231 - 217 = 12210130892159 is a prime.
It is a super-2 number, since 2×122101310232312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12210131023291) 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, 109753665 + ... + 109864858.
It is an arithmetic number, because the mean of its divisors is an integer number (1556546288850).
Almost surely, 212210131023231 is an apocalyptic number.
12210131023231 is a deficient number, since it is larger than the sum of its proper divisors (242239287569).
12210131023231 is a wasteful number, since it uses less digits than its factorization.
12210131023231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 219619625.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 12210131023231 its reverse (13232013101221), we get a palindrome (25442144124452).
The spelling of 12210131023231 in words is "twelve trillion, two hundred ten billion, one hundred thirty-one million, twenty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •