Base | Representation |
---|---|
bin | 110100110000111100… |
… | …0010110110101000101 |
3 | 101211110212020010011111 |
4 | 1221201320112311011 |
5 | 3324030144010341 |
6 | 124015434405021 |
7 | 11120650161601 |
oct | 1514170266505 |
9 | 354425203144 |
10 | 113311313221 |
11 | 44067311807 |
12 | 19b63890771 |
13 | a8ba540742 |
14 | 56acca6501 |
15 | 2e32b82681 |
hex | 1a61e16d45 |
113311313221 has 4 divisors (see below), whose sum is σ = 113316799744. Its totient is φ = 113305826700.
The previous prime is 113311313201. The next prime is 113311313237. The reversal of 113311313221 is 122313113311.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 113311313221 - 211 = 113311311173 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 113311313192 and 113311313201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113311313201) 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, 2712165 + ... + 2753626.
It is an arithmetic number, because the mean of its divisors is an integer number (28329199936).
Almost surely, 2113311313221 is an apocalyptic number.
It is an amenable number.
113311313221 is a deficient number, since it is larger than the sum of its proper divisors (5486523).
113311313221 is an equidigital number, since it uses as much as digits as its factorization.
113311313221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5486522.
The product of its digits is 324, while the sum is 22.
Adding to 113311313221 its reverse (122313113311), we get a palindrome (235624426532).
The spelling of 113311313221 in words is "one hundred thirteen billion, three hundred eleven million, three hundred thirteen thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •