Base | Representation |
---|---|
bin | 11001001111100011100001… |
… | …101011110010110101100111 |
3 | 112120002102021201120212122112 |
4 | 121033203201223302311213 |
5 | 104022423131330133111 |
6 | 1032041532540551235 |
7 | 32245636412236466 |
oct | 3117434153626547 |
9 | 476072251525575 |
10 | 111020101021031 |
11 | 324133a6813764 |
12 | 1055053325251b |
13 | 49c41c5b55087 |
14 | 1d5b589c489dd |
15 | cc7d4a9ebe8b |
hex | 64f8e1af2d67 |
111020101021031 has 2 divisors, whose sum is σ = 111020101021032. Its totient is φ = 111020101021030.
The previous prime is 111020101021021. The next prime is 111020101021133. The reversal of 111020101021031 is 130120101020111.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 111020101021031 - 214 = 111020101004647 is a prime.
It is a super-2 number, since 2×1110201010210312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 111020101020997 and 111020101021015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111020101021021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55510050510515 + 55510050510516.
It is an arithmetic number, because the mean of its divisors is an integer number (55510050510516).
Almost surely, 2111020101021031 is an apocalyptic number.
111020101021031 is a deficient number, since it is larger than the sum of its proper divisors (1).
111020101021031 is an equidigital number, since it uses as much as digits as its factorization.
111020101021031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 111020101021031 its reverse (130120101020111), we get a palindrome (241140202041142).
The spelling of 111020101021031 in words is "one hundred eleven trillion, twenty billion, one hundred one million, twenty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •