Search a number
-
+
461056501 is a prime number
BaseRepresentation
bin11011011110110…
…010100111110101
31012010120002121201
4123132302213311
51421012302001
6113430012501
714265626023
oct3336624765
91163502551
10461056501
11217288634
1210a4a7131
137469b3c9
1445339713
152a724501
hex1b7b29f5

461056501 has 2 divisors, whose sum is σ = 461056502. Its totient is φ = 461056500.

The previous prime is 461056499. The next prime is 461056523. The reversal of 461056501 is 105650164.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 392000401 + 69056100 = 19799^2 + 8310^2 .

It is a cyclic number.

It is not a de Polignac number, because 461056501 - 21 = 461056499 is a prime.

It is a super-2 number, since 2×4610565012 = 425146194228726002, which contains 22 as substring.

Together with 461056499, it forms a pair of twin primes.

It is a self number, because there is not a number n which added to its sum of digits gives 461056501.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (461056601) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 230528250 + 230528251.

It is an arithmetic number, because the mean of its divisors is an integer number (230528251).

Almost surely, 2461056501 is an apocalyptic number.

It is an amenable number.

461056501 is a deficient number, since it is larger than the sum of its proper divisors (1).

461056501 is an equidigital number, since it uses as much as digits as its factorization.

461056501 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 3600, while the sum is 28.

The square root of 461056501 is about 21472.2262702310. The cubic root of 461056501 is about 772.5347964902.

The spelling of 461056501 in words is "four hundred sixty-one million, fifty-six thousand, five hundred one".