Base | Representation |
---|---|
bin | 1011000110001100101101… |
… | …1011100001111001011111 |
3 | 1121012102020001001101101202 |
4 | 2301203023123201321133 |
5 | 3044400343222042343 |
6 | 41541041152030115 |
7 | 2366334062526560 |
oct | 261431333417137 |
9 | 47172201041352 |
10 | 12201120112223 |
11 | 3984514247989 |
12 | 14507aa53233b |
13 | 6a6739ab1c53 |
14 | 302774756167 |
15 | 1625a489edb8 |
hex | b18cb6e1e5f |
12201120112223 has 32 divisors (see below), whose sum is σ = 14182454094336. Its totient is φ = 10281373296768.
The previous prime is 12201120112201. The next prime is 12201120112231. The reversal of 12201120112223 is 32221102110221.
It is not a de Polignac number, because 12201120112223 - 218 = 12201119850079 is a prime.
It is a super-2 number, since 2×122011201122232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12201120112195 and 12201120112204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12201120112823) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 38729540 + ... + 39043302.
It is an arithmetic number, because the mean of its divisors is an integer number (443201690448).
Almost surely, 212201120112223 is an apocalyptic number.
12201120112223 is a deficient number, since it is larger than the sum of its proper divisors (1981333982113).
12201120112223 is a wasteful number, since it uses less digits than its factorization.
12201120112223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 314303.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 12201120112223 its reverse (32221102110221), we get a palindrome (44422222222444).
The spelling of 12201120112223 in words is "twelve trillion, two hundred one billion, one hundred twenty million, one hundred twelve thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •