Base | Representation |
---|---|
bin | 100110110010010… |
… | …1000111011011101 |
3 | 10100200220112101221 |
4 | 1031210220323131 |
5 | 10131132403321 |
6 | 333050333341 |
7 | 44152101133 |
oct | 11544507335 |
9 | 3320815357 |
10 | 1301450461 |
11 | 6086a8aa3 |
12 | 303a2a251 |
13 | 17982523c |
14 | c4bbb753 |
15 | 793c9e41 |
hex | 4d928edd |
1301450461 has 2 divisors, whose sum is σ = 1301450462. Its totient is φ = 1301450460.
The previous prime is 1301450443. The next prime is 1301450473. The reversal of 1301450461 is 1640541031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1030024836 + 271425625 = 32094^2 + 16475^2 .
It is a cyclic number.
It is not a de Polignac number, because 1301450461 - 213 = 1301442269 is a prime.
It is a super-2 number, since 2×13014504612 = 3387546604874225042, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1301450431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 650725230 + 650725231.
It is an arithmetic number, because the mean of its divisors is an integer number (650725231).
Almost surely, 21301450461 is an apocalyptic number.
It is an amenable number.
1301450461 is a deficient number, since it is larger than the sum of its proper divisors (1).
1301450461 is an equidigital number, since it uses as much as digits as its factorization.
1301450461 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 25.
The square root of 1301450461 is about 36075.6214222292. The cubic root of 1301450461 is about 1091.7986354791.
Adding to 1301450461 its reverse (1640541031), we get a palindrome (2941991492).
The spelling of 1301450461 in words is "one billion, three hundred one million, four hundred fifty thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •