Base | Representation |
---|---|
bin | 10000000001011010000… |
… | …001101100000110111111 |
3 | 10220020221010011202122111 |
4 | 100001122001230012333 |
5 | 121014343114120111 |
6 | 2201445202554451 |
7 | 142355231516533 |
oct | 20013201540677 |
9 | 3806833152574 |
10 | 1101022020031 |
11 | 394a3925484a |
12 | 159476068a27 |
13 | 7ca9775515b |
14 | 3b40b107bc3 |
15 | 1d990581a21 |
hex | 1005a06c1bf |
1101022020031 has 2 divisors, whose sum is σ = 1101022020032. Its totient is φ = 1101022020030.
The previous prime is 1101022020017. The next prime is 1101022020061. The reversal of 1101022020031 is 1300202201011.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1101022020031 is a prime.
It is a super-2 number, since 2×11010220200312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1101022019993 and 1101022020020.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1101022020061) 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, 550511010015 + 550511010016.
It is an arithmetic number, because the mean of its divisors is an integer number (550511010016).
Almost surely, 21101022020031 is an apocalyptic number.
1101022020031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101022020031 is an equidigital number, since it uses as much as digits as its factorization.
1101022020031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 1101022020031 its reverse (1300202201011), we get a palindrome (2401224221042).
The spelling of 1101022020031 in words is "one trillion, one hundred one billion, twenty-two million, twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •