Base | Representation |
---|---|
bin | 110100101110001110… |
… | …0000110101111011101 |
3 | 101211020111110000002000 |
4 | 1221130130012233131 |
5 | 3323333311134323 |
6 | 124002413552513 |
7 | 11115461205255 |
oct | 1513434065735 |
9 | 354214400060 |
10 | 113220021213 |
11 | 4401a828772 |
12 | 19b391a5739 |
13 | a8a46586c0 |
14 | 56a0b00965 |
15 | 2e29b4ce43 |
hex | 1a5c706bdd |
113220021213 has 16 divisors (see below), whose sum is σ = 180635931840. Its totient is φ = 69673858992.
The previous prime is 113220021193. The next prime is 113220021241. The reversal of 113220021213 is 312120022311.
It is not a de Polignac number, because 113220021213 - 212 = 113220017117 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113220021113) 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, 161281731 + ... + 161282432.
It is an arithmetic number, because the mean of its divisors is an integer number (11289745740).
Almost surely, 2113220021213 is an apocalyptic number.
113220021213 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
113220021213 is a deficient number, since it is larger than the sum of its proper divisors (67415910627).
113220021213 is a wasteful number, since it uses less digits than its factorization.
113220021213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 322564185 (or 322564179 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 113220021213 its reverse (312120022311), we get a palindrome (425340043524).
The spelling of 113220021213 in words is "one hundred thirteen billion, two hundred twenty million, twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •