Base | Representation |
---|---|
bin | 1110101001001… |
… | …1011110000001 |
3 | 11021120112101012 |
4 | 3222103132001 |
5 | 111210441231 |
6 | 10032250305 |
7 | 1344034154 |
oct | 352233601 |
9 | 137515335 |
10 | 61421441 |
11 | 31741924 |
12 | 186a0995 |
13 | c956c63 |
14 | 822bc9b |
15 | 55d3e2b |
hex | 3a93781 |
61421441 has 2 divisors, whose sum is σ = 61421442. Its totient is φ = 61421440.
The previous prime is 61421413. The next prime is 61421453. The reversal of 61421441 is 14412416.
It is a happy number.
61421441 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., 47886400 + 13535041 = 6920^2 + 3679^2 .
It is a cyclic number.
It is not a de Polignac number, because 61421441 - 26 = 61421377 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (61421341) 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, 30710720 + 30710721.
It is an arithmetic number, because the mean of its divisors is an integer number (30710721).
Almost surely, 261421441 is an apocalyptic number.
It is an amenable number.
61421441 is a deficient number, since it is larger than the sum of its proper divisors (1).
61421441 is an equidigital number, since it uses as much as digits as its factorization.
61421441 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 768, while the sum is 23.
The square root of 61421441 is about 7837.1832312381. The cubic root of 61421441 is about 394.5541966158.
Adding to 61421441 its reverse (14412416), we get a palindrome (75833857).
The spelling of 61421441 in words is "sixty-one million, four hundred twenty-one thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •