Base | Representation |
---|---|
bin | 10000001100110111101… |
… | …010000011100010111101 |
3 | 10221102200220101020010221 |
4 | 100030313222003202331 |
5 | 121220100024113432 |
6 | 2211242404101341 |
7 | 143302235263126 |
oct | 20146752034275 |
9 | 3842626336127 |
10 | 1113330301117 |
11 | 39a184a26581 |
12 | 15b930094851 |
13 | 80ca9726b08 |
14 | 3bc57a5304d |
15 | 1de60de9b97 |
hex | 10337a838bd |
1113330301117 has 2 divisors, whose sum is σ = 1113330301118. Its totient is φ = 1113330301116.
The previous prime is 1113330301099. The next prime is 1113330301123. The reversal of 1113330301117 is 7111030333111.
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., 789803686681 + 323526614436 = 888709^2 + 568794^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1113330301117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1113330301091 and 1113330301100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1113330301177) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 556665150558 + 556665150559.
It is an arithmetic number, because the mean of its divisors is an integer number (556665150559).
Almost surely, 21113330301117 is an apocalyptic number.
It is an amenable number.
1113330301117 is a deficient number, since it is larger than the sum of its proper divisors (1).
1113330301117 is an equidigital number, since it uses as much as digits as its factorization.
1113330301117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 567, while the sum is 25.
Adding to 1113330301117 its reverse (7111030333111), we get a palindrome (8224360634228).
The spelling of 1113330301117 in words is "one trillion, one hundred thirteen billion, three hundred thirty million, three hundred one thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •