Base | Representation |
---|---|
bin | 11001000011110101000… |
… | …01111000010101011101 |
3 | 10001022111222220110010122 |
4 | 30201322201320111131 |
5 | 103101412041123203 |
6 | 1455321023444325 |
7 | 116131413052214 |
oct | 14417241702535 |
9 | 3038458813118 |
10 | 861049161053 |
11 | 302194893004 |
12 | 11aa637566a5 |
13 | 63272b97303 |
14 | 2d9642c207b |
15 | 175e7bd7538 |
hex | c87a87855d |
861049161053 has 2 divisors, whose sum is σ = 861049161054. Its totient is φ = 861049161052.
The previous prime is 861049161031. The next prime is 861049161073. The reversal of 861049161053 is 350161940168.
861049161053 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 491235577924 + 369813583129 = 700882^2 + 608123^2 .
It is a cyclic number.
It is not a de Polignac number, because 861049161053 - 234 = 843869291869 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 861049160995 and 861049161013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (861049161023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 430524580526 + 430524580527.
It is an arithmetic number, because the mean of its divisors is an integer number (430524580527).
Almost surely, 2861049161053 is an apocalyptic number.
It is an amenable number.
861049161053 is a deficient number, since it is larger than the sum of its proper divisors (1).
861049161053 is an equidigital number, since it uses as much as digits as its factorization.
861049161053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 155520, while the sum is 44.
The spelling of 861049161053 in words is "eight hundred sixty-one billion, forty-nine million, one hundred sixty-one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •