Base | Representation |
---|---|
bin | 10000000001011001010… |
… | …100100110010111101001 |
3 | 10220020220021221020200002 |
4 | 100001121110212113221 |
5 | 121014332102400131 |
6 | 2201444101352345 |
7 | 142355026200113 |
oct | 20013124462751 |
9 | 3806807836602 |
10 | 1101010200041 |
11 | 394a32611264 |
12 | 1594721086b5 |
13 | 7ca9517708b |
14 | 3b40970c3b3 |
15 | 1d98e4e96cb |
hex | 100595265e9 |
1101010200041 has 2 divisors, whose sum is σ = 1101010200042. Its totient is φ = 1101010200040.
The previous prime is 1101010199899. The next prime is 1101010200083. The reversal of 1101010200041 is 1400020101011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 664909776400 + 436100423641 = 815420^2 + 660379^2 .
It is a cyclic number.
It is not a de Polignac number, because 1101010200041 - 218 = 1101009937897 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1101010199995 and 1101010200031.
It is not a weakly prime, because it can be changed into another prime (1101010200091) 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, 550505100020 + 550505100021.
It is an arithmetic number, because the mean of its divisors is an integer number (550505100021).
Almost surely, 21101010200041 is an apocalyptic number.
It is an amenable number.
1101010200041 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101010200041 is an equidigital number, since it uses as much as digits as its factorization.
1101010200041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1101010200041 its reverse (1400020101011), we get a palindrome (2501030301052).
The spelling of 1101010200041 in words is "one trillion, one hundred one billion, ten million, two hundred thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •