Base | Representation |
---|---|
bin | 111011110101110011100… |
… | …011001101001100101101 |
3 | 112120010100211202210011221 |
4 | 323311303203031030231 |
5 | 1014333312402424323 |
6 | 12425043455343341 |
7 | 603045462626032 |
oct | 73656343151455 |
9 | 15503324683157 |
10 | 4112222311213 |
11 | 1345a90320015 |
12 | 564b86b21b51 |
13 | 23aa1c839393 |
14 | 10306572b389 |
15 | 71e7d22a55d |
hex | 3bd738cd32d |
4112222311213 has 4 divisors (see below), whose sum is σ = 4112234775900. Its totient is φ = 4112209846528.
The previous prime is 4112222311159. The next prime is 4112222311271. The reversal of 4112222311213 is 3121132222114.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3908204778724 + 204017532489 = 1976918^2 + 451683^2 .
It is a cyclic number.
It is not a de Polignac number, because 4112222311213 - 29 = 4112222310701 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4112282311213) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5723638 + ... + 6401911.
It is an arithmetic number, because the mean of its divisors is an integer number (1028058693975).
Almost surely, 24112222311213 is an apocalyptic number.
It is an amenable number.
4112222311213 is a deficient number, since it is larger than the sum of its proper divisors (12464687).
4112222311213 is a wasteful number, since it uses less digits than its factorization.
4112222311213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12464686.
The product of its digits is 1152, while the sum is 25.
Adding to 4112222311213 its reverse (3121132222114), we get a palindrome (7233354533327).
The spelling of 4112222311213 in words is "four trillion, one hundred twelve billion, two hundred twenty-two million, three hundred eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •