Base | Representation |
---|---|
bin | 111001010010010110… |
… | …011011001011101001 |
3 | 12212202211002022002012 |
4 | 321102112123023221 |
5 | 2001433323333421 |
6 | 44131405245305 |
7 | 4305206111501 |
oct | 712226331351 |
9 | 185684068065 |
10 | 61511152361 |
11 | 240a549520a |
12 | bb07b63835 |
13 | 5a53855699 |
14 | 2d9745aa01 |
15 | 190025195b |
hex | e5259b2e9 |
61511152361 has 2 divisors, whose sum is σ = 61511152362. Its totient is φ = 61511152360.
The previous prime is 61511152337. The next prime is 61511152363. The reversal of 61511152361 is 16325111516.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 46589064025 + 14922088336 = 215845^2 + 122156^2 .
It is a cyclic number.
It is not a de Polignac number, because 61511152361 - 222 = 61506958057 is a prime.
Together with 61511152363, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (61511152363) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 30755576180 + 30755576181.
It is an arithmetic number, because the mean of its divisors is an integer number (30755576181).
Almost surely, 261511152361 is an apocalyptic number.
It is an amenable number.
61511152361 is a deficient number, since it is larger than the sum of its proper divisors (1).
61511152361 is an equidigital number, since it uses as much as digits as its factorization.
61511152361 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5400, while the sum is 32.
Adding to 61511152361 its reverse (16325111516), we get a palindrome (77836263877).
The spelling of 61511152361 in words is "sixty-one billion, five hundred eleven million, one hundred fifty-two thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •