Base | Representation |
---|---|
bin | 110100110000101100… |
… | …1111000001001001101 |
3 | 101211110022012011221021 |
4 | 1221201121320021031 |
5 | 3324021122320323 |
6 | 124014551234141 |
7 | 11120522233243 |
oct | 1514131701115 |
9 | 354408164837 |
10 | 113303323213 |
11 | 440628547a3 |
12 | 19b61078951 |
13 | a8b89a3a22 |
14 | 56abbc6793 |
15 | 2e3210505d |
hex | 1a6167824d |
113303323213 has 2 divisors, whose sum is σ = 113303323214. Its totient is φ = 113303323212.
The previous prime is 113303323169. The next prime is 113303323229. The reversal of 113303323213 is 312323303311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 100151362089 + 13151961124 = 316467^2 + 114682^2 .
It is a cyclic number.
It is not a de Polignac number, because 113303323213 - 29 = 113303322701 is a prime.
It is a super-2 number, since 2×1133033232132 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113303323253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56651661606 + 56651661607.
It is an arithmetic number, because the mean of its divisors is an integer number (56651661607).
Almost surely, 2113303323213 is an apocalyptic number.
It is an amenable number.
113303323213 is a deficient number, since it is larger than the sum of its proper divisors (1).
113303323213 is an equidigital number, since it uses as much as digits as its factorization.
113303323213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 113303323213 its reverse (312323303311), we get a palindrome (425626626524).
The spelling of 113303323213 in words is "one hundred thirteen billion, three hundred three million, three hundred twenty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •