Base | Representation |
---|---|
bin | 11101011100001000010… |
… | …01010101001010010001 |
3 | 10120200221120100021021211 |
4 | 32232010021111022101 |
5 | 113033110243244131 |
6 | 2052405323420121 |
7 | 133036523064322 |
oct | 16560411251221 |
9 | 3520846307254 |
10 | 1011534353041 |
11 | 35aa97854073 |
12 | 144060984641 |
13 | 74505b15704 |
14 | 36d5c292449 |
15 | 1b4a41a75b1 |
hex | eb84255291 |
1011534353041 has 2 divisors, whose sum is σ = 1011534353042. Its totient is φ = 1011534353040.
The previous prime is 1011534352993. The next prime is 1011534353117. The reversal of 1011534353041 is 1403534351101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1002451500625 + 9082852416 = 1001225^2 + 95304^2 .
It is an emirp because it is prime and its reverse (1403534351101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1011534353041 - 215 = 1011534320273 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1011534352994 and 1011534353012.
It is not a weakly prime, because it can be changed into another prime (1011534353341) 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, 505767176520 + 505767176521.
It is an arithmetic number, because the mean of its divisors is an integer number (505767176521).
Almost surely, 21011534353041 is an apocalyptic number.
It is an amenable number.
1011534353041 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011534353041 is an equidigital number, since it uses as much as digits as its factorization.
1011534353041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10800, while the sum is 31.
The spelling of 1011534353041 in words is "one trillion, eleven billion, five hundred thirty-four million, three hundred fifty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •