Base | Representation |
---|---|
bin | 10000001011111011100… |
… | …001000111000011001101 |
3 | 10221100002120210211122221 |
4 | 100023323201013003031 |
5 | 121211013224320323 |
6 | 2210554322135341 |
7 | 143235234150442 |
oct | 20137341070315 |
9 | 3840076724587 |
10 | 1112321323213 |
11 | 399807430541 |
12 | 15b6aa1b1551 |
13 | 80b78695379 |
14 | 3bb9da499c9 |
15 | 1de0254355d |
hex | 102fb8470cd |
1112321323213 has 8 divisors (see below), whose sum is σ = 1150830900000. Its totient is φ = 1073821991088.
The previous prime is 1112321323193. The next prime is 1112321323237. The reversal of 1112321323213 is 3123231232111.
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 1112321323213 - 29 = 1112321322701 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 (1112321383213) 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 7 ways as a sum of consecutive naturals, for example, 2339931 + ... + 2774872.
It is an arithmetic number, because the mean of its divisors is an integer number (143853862500).
Almost surely, 21112321323213 is an apocalyptic number.
It is an amenable number.
1112321323213 is a deficient number, since it is larger than the sum of its proper divisors (38509576787).
1112321323213 is an equidigital number, since it uses as much as digits as its factorization.
1112321323213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5122331.
The product of its digits is 1296, while the sum is 25.
Adding to 1112321323213 its reverse (3123231232111), we get a palindrome (4235552555324).
The spelling of 1112321323213 in words is "one trillion, one hundred twelve billion, three hundred twenty-one million, three hundred twenty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •