Base | Representation |
---|---|
bin | 11000011010000111111101 |
3 | 110001002001001 |
4 | 120122013331 |
5 | 3114222321 |
6 | 345050301 |
7 | 105246256 |
oct | 30320775 |
9 | 13032031 |
10 | 6398461 |
11 | 3680293 |
12 | 2186991 |
13 | 1430494 |
14 | bc7b2d |
15 | 865c91 |
hex | 61a1fd |
6398461 has 2 divisors, whose sum is σ = 6398462. Its totient is φ = 6398460.
The previous prime is 6398453. The next prime is 6398467. The reversal of 6398461 is 1648936.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6095961 + 302500 = 2469^2 + 550^2 .
It is a cyclic number.
It is not a de Polignac number, because 6398461 - 23 = 6398453 is a prime.
It is a d-powerful number, because it can be written as 64 + 3 + 95 + 87 + 411 + 66 + 1 .
6398461 is a lucky number.
It is a self number, because there is not a number n which added to its sum of digits gives 6398461.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6398467) 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, 3199230 + 3199231.
It is an arithmetic number, because the mean of its divisors is an integer number (3199231).
Almost surely, 26398461 is an apocalyptic number.
It is an amenable number.
6398461 is a deficient number, since it is larger than the sum of its proper divisors (1).
6398461 is an equidigital number, since it uses as much as digits as its factorization.
6398461 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 31104, while the sum is 37.
The square root of 6398461 is about 2529.5179382641. The cubic root of 6398461 is about 185.6486700573.
It can be divided in two parts, 6398 and 461, that added together give a cube (6859 = 193).
The spelling of 6398461 in words is "six million, three hundred ninety-eight thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •