Base | Representation |
---|---|
bin | 10000001011101001000… |
… | …001101111101001111001 |
3 | 10221022021222002102112221 |
4 | 100023221001233221321 |
5 | 121204344321023113 |
6 | 2210503441204041 |
7 | 143224446325654 |
oct | 20135101575171 |
9 | 3838258072487 |
10 | 1112011111033 |
11 | 399668311539 |
12 | 15b622330621 |
13 | 80b29330274 |
14 | 3bb7077889b |
15 | 1ddd51b898d |
hex | 102e906fa79 |
1112011111033 has 2 divisors, whose sum is σ = 1112011111034. Its totient is φ = 1112011111032.
The previous prime is 1112011111019. The next prime is 1112011111073. The reversal of 1112011111033 is 3301111102111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 613422603369 + 498588507664 = 783213^2 + 706108^2 .
It is a cyclic number.
It is not a de Polignac number, because 1112011111033 - 213 = 1112011102841 is a prime.
It is a super-2 number, since 2×11120111110332 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1112011110998 and 1112011111016.
It is not a weakly prime, because it can be changed into another prime (1112011111073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 556005555516 + 556005555517.
It is an arithmetic number, because the mean of its divisors is an integer number (556005555517).
Almost surely, 21112011111033 is an apocalyptic number.
It is an amenable number.
1112011111033 is a deficient number, since it is larger than the sum of its proper divisors (1).
1112011111033 is an equidigital number, since it uses as much as digits as its factorization.
1112011111033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18, while the sum is 16.
Adding to 1112011111033 its reverse (3301111102111), we get a palindrome (4413122213144).
The spelling of 1112011111033 in words is "one trillion, one hundred twelve billion, eleven million, one hundred eleven thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •