Search a number
-
+
1650380581 is a prime number
BaseRepresentation
bin110001001011110…
…1100111100100101
311021000111000112201
41202113230330211
511334444134311
6431433214501
755620001123
oct14227547445
94230430481
101650380581
117776623a3
123a0861431
13203bc5475
1411928a913
1599d519c1
hex625ecf25

1650380581 has 2 divisors, whose sum is σ = 1650380582. Its totient is φ = 1650380580.

The previous prime is 1650380561. The next prime is 1650380593. The reversal of 1650380581 is 1850830561.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1486796481 + 163584100 = 38559^2 + 12790^2 .

It is a cyclic number.

It is not a de Polignac number, because 1650380581 - 211 = 1650378533 is a prime.

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

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (1650380521) 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, 825190290 + 825190291.

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

Almost surely, 21650380581 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 28800, while the sum is 37.

The square root of 1650380581 is about 40624.8763813504. The cubic root of 1650380581 is about 1181.7565959141.

The spelling of 1650380581 in words is "one billion, six hundred fifty million, three hundred eighty thousand, five hundred eighty-one".