Base | Representation |
---|---|
bin | 11001010011111101101101… |
… | …111001000001100100100101 |
3 | 112121011101101022112010220002 |
4 | 121103331231321001210211 |
5 | 104042404202324311323 |
6 | 1032433043202151045 |
7 | 32306554135531241 |
oct | 3123755571014445 |
9 | 477141338463802 |
10 | 111323101010213 |
11 | 3251a953373264 |
12 | 1059b1b5352485 |
13 | 4a169533632c1 |
14 | 1d6c0d158d421 |
15 | cd0b8174b828 |
hex | 653f6de41925 |
111323101010213 has 16 divisors (see below), whose sum is σ = 119927893942272. Its totient is φ = 103033029726000.
The previous prime is 111323101010197. The next prime is 111323101010221. The reversal of 111323101010213 is 312010101323111.
It is a cyclic number.
It is not a de Polignac number, because 111323101010213 - 24 = 111323101010197 is a prime.
It is a super-2 number, since 2×1113231010102132 (a number of 29 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 (111323101010273) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6462743 + ... + 16260788.
It is an arithmetic number, because the mean of its divisors is an integer number (7495493371392).
Almost surely, 2111323101010213 is an apocalyptic number.
It is an amenable number.
111323101010213 is a deficient number, since it is larger than the sum of its proper divisors (8604792932059).
111323101010213 is a wasteful number, since it uses less digits than its factorization.
111323101010213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22730456.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 111323101010213 its reverse (312010101323111), we get a palindrome (423333202333324).
The spelling of 111323101010213 in words is "one hundred eleven trillion, three hundred twenty-three billion, one hundred one million, ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •