Base | Representation |
---|---|
bin | 100101100001110101111101… |
… | …111011110010110010000001 |
3 | 210122101221201000010100122202 |
4 | 211201311331323302302001 |
5 | 133113213341211410411 |
6 | 1343012253521442545 |
7 | 46523500251343031 |
oct | 4541657573626201 |
9 | 718357630110582 |
10 | 165053411044481 |
11 | 48655838668013 |
12 | 166185594a0455 |
13 | 711361541a30b |
14 | 2ca88b06658c1 |
15 | 1413640b2383b |
hex | 961d7def2c81 |
165053411044481 has 2 divisors, whose sum is σ = 165053411044482. Its totient is φ = 165053411044480.
The previous prime is 165053411044451. The next prime is 165053411044583. The reversal of 165053411044481 is 184440114350561.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 129951814928881 + 35101596115600 = 11399641^2 + 5924660^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-165053411044481 is a prime.
It is a super-2 number, since 2×1650534110444812 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (165053411044451) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 82526705522240 + 82526705522241.
It is an arithmetic number, because the mean of its divisors is an integer number (82526705522241).
Almost surely, 2165053411044481 is an apocalyptic number.
It is an amenable number.
165053411044481 is a deficient number, since it is larger than the sum of its proper divisors (1).
165053411044481 is an equidigital number, since it uses as much as digits as its factorization.
165053411044481 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 921600, while the sum is 47.
The spelling of 165053411044481 in words is "one hundred sixty-five trillion, fifty-three billion, four hundred eleven million, forty-four thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •