Base | Representation |
---|---|
bin | 1011011100000100… |
… | …01001010000011101 |
3 | 120211222102022012222 |
4 | 11232002021100131 |
5 | 100034100221021 |
6 | 2453211235125 |
7 | 305115556622 |
oct | 55602112035 |
9 | 16758368188 |
10 | 6141023261 |
11 | 26714a173a |
12 | 1234748aa5 |
13 | 76b373a99 |
14 | 42383c349 |
15 | 25e1e26ab |
hex | 16e08941d |
6141023261 has 2 divisors, whose sum is σ = 6141023262. Its totient is φ = 6141023260.
The previous prime is 6141023257. The next prime is 6141023263. The reversal of 6141023261 is 1623201416.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5252625625 + 888397636 = 72475^2 + 29806^2 .
It is a cyclic number.
It is not a de Polignac number, because 6141023261 - 22 = 6141023257 is a prime.
Together with 6141023263, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 6141023261.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6141023263) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3070511630 + 3070511631.
It is an arithmetic number, because the mean of its divisors is an integer number (3070511631).
Almost surely, 26141023261 is an apocalyptic number.
It is an amenable number.
6141023261 is a deficient number, since it is larger than the sum of its proper divisors (1).
6141023261 is an equidigital number, since it uses as much as digits as its factorization.
6141023261 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 26.
The square root of 6141023261 is about 78364.6812090753. The cubic root of 6141023261 is about 1831.2469490240.
Adding to 6141023261 its reverse (1623201416), we get a palindrome (7764224677).
The spelling of 6141023261 in words is "six billion, one hundred forty-one million, twenty-three thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •