Base | Representation |
---|---|
bin | 1110101001000… |
… | …0001100010101 |
3 | 11021112211222011 |
4 | 3222100030111 |
5 | 111210024041 |
6 | 10032104221 |
7 | 1343650063 |
oct | 352201425 |
9 | 137484864 |
10 | 61408021 |
11 | 31732834 |
12 | 18695071 |
13 | c950b0c |
14 | 8227033 |
15 | 55cee81 |
hex | 3a90315 |
61408021 has 2 divisors, whose sum is σ = 61408022. Its totient is φ = 61408020.
The previous prime is 61408013. The next prime is 61408069. The reversal of 61408021 is 12080416.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 33466225 + 27941796 = 5785^2 + 5286^2 .
It is a cyclic number.
It is not a de Polignac number, because 61408021 - 23 = 61408013 is a prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 61407983 and 61408001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (61408001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 30704010 + 30704011.
It is an arithmetic number, because the mean of its divisors is an integer number (30704011).
Almost surely, 261408021 is an apocalyptic number.
It is an amenable number.
61408021 is a deficient number, since it is larger than the sum of its proper divisors (1).
61408021 is an equidigital number, since it uses as much as digits as its factorization.
61408021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 22.
The square root of 61408021 is about 7836.3270095115. The cubic root of 61408021 is about 394.5254590777.
Adding to 61408021 its reverse (12080416), we get a palindrome (73488437).
It can be divided in two parts, 6140 and 8021, that added together give a square (14161 = 1192).
The spelling of 61408021 in words is "sixty-one million, four hundred eight thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •