Base | Representation |
---|---|
bin | 11100101011110… |
… | …101001001111001 |
3 | 1020112120010120201 |
4 | 130223311021321 |
5 | 1441200030321 |
6 | 115430522201 |
7 | 14632400641 |
oct | 3453651171 |
9 | 1215503521 |
10 | 481251961 |
11 | 2277217a3 |
12 | 115206361 |
13 | 7891c798 |
14 | 47cb5521 |
15 | 2c3b3291 |
hex | 1caf5279 |
481251961 has 2 divisors, whose sum is σ = 481251962. Its totient is φ = 481251960.
The previous prime is 481251937. The next prime is 481251983. The reversal of 481251961 is 169152184.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 470890000 + 10361961 = 21700^2 + 3219^2 .
It is a cyclic number.
It is not a de Polignac number, because 481251961 - 27 = 481251833 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 481251961.
It is not a weakly prime, because it can be changed into another prime (481251061) 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, 240625980 + 240625981.
It is an arithmetic number, because the mean of its divisors is an integer number (240625981).
Almost surely, 2481251961 is an apocalyptic number.
It is an amenable number.
481251961 is a deficient number, since it is larger than the sum of its proper divisors (1).
481251961 is an equidigital number, since it uses as much as digits as its factorization.
481251961 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 17280, while the sum is 37.
The square root of 481251961 is about 21937.4556637729. The cubic root of 481251961 is about 783.6536680295.
It can be divided in two parts, 48125 and 1961, that added together give a triangular number (50086 = T316).
The spelling of 481251961 in words is "four hundred eighty-one million, two hundred fifty-one thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •