Base | Representation |
---|---|
bin | 110100110001100000… |
… | …0011100110011110001 |
3 | 101211112011210021112021 |
4 | 1221203000130303301 |
5 | 3324100013241311 |
6 | 124021351431441 |
7 | 11121266623402 |
oct | 1514300346361 |
9 | 354464707467 |
10 | 113330212081 |
11 | 44076a4a7a9 |
12 | 19b6a085581 |
13 | a8c14298b8 |
14 | 56b15c59a9 |
15 | 2e34667171 |
hex | 1a6301ccf1 |
113330212081 has 2 divisors, whose sum is σ = 113330212082. Its totient is φ = 113330212080.
The previous prime is 113330212049. The next prime is 113330212087. The reversal of 113330212081 is 180212033311.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 69569337600 + 43760874481 = 263760^2 + 209191^2 .
It is a cyclic number.
It is not a de Polignac number, because 113330212081 - 25 = 113330212049 is a prime.
It is a super-2 number, since 2×1133302120812 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (113330212087) 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, 56665106040 + 56665106041.
It is an arithmetic number, because the mean of its divisors is an integer number (56665106041).
Almost surely, 2113330212081 is an apocalyptic number.
It is an amenable number.
113330212081 is a deficient number, since it is larger than the sum of its proper divisors (1).
113330212081 is an equidigital number, since it uses as much as digits as its factorization.
113330212081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 25.
Adding to 113330212081 its reverse (180212033311), we get a palindrome (293542245392).
The spelling of 113330212081 in words is "one hundred thirteen billion, three hundred thirty million, two hundred twelve thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •