Base | Representation |
---|---|
bin | 111000110101100000… |
… | …110001101101100101 |
3 | 12211112002200102012202 |
4 | 320311200301231211 |
5 | 1444440443424241 |
6 | 44011403224245 |
7 | 4260212501426 |
oct | 706540615545 |
9 | 184462612182 |
10 | 61027326821 |
11 | 2397737599a |
12 | b9b1b18085 |
13 | 59a7544696 |
14 | 2d4d0b564d |
15 | 18c2a30d9b |
hex | e35831b65 |
61027326821 has 2 divisors, whose sum is σ = 61027326822. Its totient is φ = 61027326820.
The previous prime is 61027326809. The next prime is 61027326823. The reversal of 61027326821 is 12862372016.
It is a happy number.
61027326821 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., 55077518596 + 5949808225 = 234686^2 + 77135^2 .
It is a cyclic number.
It is not a de Polignac number, because 61027326821 - 210 = 61027325797 is a prime.
Together with 61027326823, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (61027326823) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 30513663410 + 30513663411.
It is an arithmetic number, because the mean of its divisors is an integer number (30513663411).
Almost surely, 261027326821 is an apocalyptic number.
It is an amenable number.
61027326821 is a deficient number, since it is larger than the sum of its proper divisors (1).
61027326821 is an equidigital number, since it uses as much as digits as its factorization.
61027326821 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48384, while the sum is 38.
Adding to 61027326821 its reverse (12862372016), we get a palindrome (73889698837).
The spelling of 61027326821 in words is "sixty-one billion, twenty-seven million, three hundred twenty-six thousand, eight hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •