Base | Representation |
---|---|
bin | 110100101110010000… |
… | …0111110111100101101 |
3 | 101211020120211222020222 |
4 | 1221130200332330231 |
5 | 3323334123100023 |
6 | 124002501221125 |
7 | 11115505112453 |
oct | 1513440767455 |
9 | 354216758228 |
10 | 113221300013 |
11 | 44020521528 |
12 | 19b397017a5 |
13 | a8a49b57a3 |
14 | 56a0d549d3 |
15 | 2e29d01cc8 |
hex | 1a5c83ef2d |
113221300013 has 4 divisors (see below), whose sum is σ = 113309548608. Its totient is φ = 113133051420.
The previous prime is 113221299977. The next prime is 113221300019. The reversal of 113221300013 is 310003122311.
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 113221300013 - 210 = 113221298989 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 113221299964 and 113221300000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113221300019) 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, 44122373 + ... + 44124938.
It is an arithmetic number, because the mean of its divisors is an integer number (28327387152).
Almost surely, 2113221300013 is an apocalyptic number.
It is an amenable number.
113221300013 is a deficient number, since it is larger than the sum of its proper divisors (88248595).
113221300013 is an equidigital number, since it uses as much as digits as its factorization.
113221300013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88248594.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 113221300013 its reverse (310003122311), we get a palindrome (423224422324).
The spelling of 113221300013 in words is "one hundred thirteen billion, two hundred twenty-one million, three hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •