Search a number
-
+
650485141 is a prime number
BaseRepresentation
bin100110110001011…
…001110110010101
31200100000001212021
4212301121312111
52313011011031
6144314053141
722056014065
oct4661316625
91610001767
10650485141
11304200129
12161a1a1b1
13a49c3a67
14625693a5
153c191511
hex26c59d95

650485141 has 2 divisors, whose sum is σ = 650485142. Its totient is φ = 650485140.

The previous prime is 650485079. The next prime is 650485153. The reversal of 650485141 is 141584056.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 415752100 + 234733041 = 20390^2 + 15321^2 .

It is a cyclic number.

It is not a de Polignac number, because 650485141 - 27 = 650485013 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 650485097 and 650485106.

It is a congruent number.

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

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

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

Almost surely, 2650485141 is an apocalyptic number.

It is an amenable number.

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

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

650485141 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 19200, while the sum is 34.

The square root of 650485141 is about 25504.6101911007. The cubic root of 650485141 is about 866.4545635950.

The spelling of 650485141 in words is "six hundred fifty million, four hundred eighty-five thousand, one hundred forty-one".