Base | Representation |
---|---|
bin | 1110100011010… |
… | …0000110111001 |
3 | 11020211200120112 |
4 | 3220310012321 |
5 | 111110441331 |
6 | 10020034105 |
7 | 1340516324 |
oct | 350640671 |
9 | 136750515 |
10 | 61030841 |
11 | 314a5413 |
12 | 18532935 |
13 | c84b231 |
14 | 81697bb |
15 | 555832b |
hex | 3a341b9 |
61030841 has 2 divisors, whose sum is σ = 61030842. Its totient is φ = 61030840.
The previous prime is 61030811. The next prime is 61030843. The reversal of 61030841 is 14803016.
61030841 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., 36240400 + 24790441 = 6020^2 + 4979^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-61030841 is a prime.
Together with 61030843, 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 (61030843) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 30515420 + 30515421.
It is an arithmetic number, because the mean of its divisors is an integer number (30515421).
Almost surely, 261030841 is an apocalyptic number.
It is an amenable number.
61030841 is a deficient number, since it is larger than the sum of its proper divisors (1).
61030841 is an equidigital number, since it uses as much as digits as its factorization.
61030841 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 23.
The square root of 61030841 is about 7812.2238191183. The cubic root of 61030841 is about 393.7160489413.
Adding to 61030841 its reverse (14803016), we get a palindrome (75833857).
The spelling of 61030841 in words is "sixty-one million, thirty thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •