Base | Representation |
---|---|
bin | 10000000000011110011… |
… | …000010010011000111001 |
3 | 10220011100101011110222021 |
4 | 100000132120102120321 |
5 | 121010320423423113 |
6 | 2201202014154441 |
7 | 142321360603561 |
oct | 20003630223071 |
9 | 3804311143867 |
10 | 1100021311033 |
11 | 394575397317 |
12 | 159236ab2a21 |
13 | 7c96832a358 |
14 | 3b354253da1 |
15 | 1d9327b048d |
hex | 1001e612639 |
1100021311033 has 2 divisors, whose sum is σ = 1100021311034. Its totient is φ = 1100021311032.
The previous prime is 1100021311013. The next prime is 1100021311043. The reversal of 1100021311033 is 3301131200011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 979856475129 + 120164835904 = 989877^2 + 346648^2 .
It is a cyclic number.
It is not a de Polignac number, because 1100021311033 - 25 = 1100021311001 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1100021310998 and 1100021311016.
It is not a weakly prime, because it can be changed into another prime (1100021311013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550010655516 + 550010655517.
It is an arithmetic number, because the mean of its divisors is an integer number (550010655517).
Almost surely, 21100021311033 is an apocalyptic number.
It is an amenable number.
1100021311033 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100021311033 is an equidigital number, since it uses as much as digits as its factorization.
1100021311033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 1100021311033 its reverse (3301131200011), we get a palindrome (4401152511044).
The spelling of 1100021311033 in words is "one trillion, one hundred billion, twenty-one million, three hundred eleven thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •