Base | Representation |
---|---|
bin | 1011000000011100001101… |
… | …0110000110011001100011 |
3 | 1120211221220010211101001011 |
4 | 2300013003112012121203 |
5 | 3041240301224121311 |
6 | 41423401331321351 |
7 | 2356232542410211 |
oct | 260070326063143 |
9 | 46757803741034 |
10 | 12102200223331 |
11 | 3946572582299 |
12 | 14355a2450257 |
13 | 69a303cab50a |
14 | 2dba6cd37cb1 |
15 | 15ec153bd321 |
hex | b01c3586663 |
12102200223331 has 32 divisors (see below), whose sum is σ = 12513867125760. Its totient is φ = 11698110014976.
The previous prime is 12102200223313. The next prime is 12102200223391. The reversal of 12102200223331 is 13332200220121.
It is a cyclic number.
It is not a de Polignac number, because 12102200223331 - 213 = 12102200215139 is a prime.
It is a super-2 number, since 2×121022002233312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12102200223391) 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 31 ways as a sum of consecutive naturals, for example, 792591765 + ... + 792607033.
It is an arithmetic number, because the mean of its divisors is an integer number (391058347680).
Almost surely, 212102200223331 is an apocalyptic number.
12102200223331 is a deficient number, since it is larger than the sum of its proper divisors (411666902429).
12102200223331 is a wasteful number, since it uses less digits than its factorization.
12102200223331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16123.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 12102200223331 its reverse (13332200220121), we get a palindrome (25434400443452).
The spelling of 12102200223331 in words is "twelve trillion, one hundred two billion, two hundred million, two hundred twenty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •