Search a number
-
+
650151022157 = 71322931198763
BaseRepresentation
bin10010111011000000000…
…01010100111001001101
32022011011010211221120022
421131200001110321031
541123002130202112
61214401504431525
764654230335420
oct11354001247115
92264133757508
10650151022157
1123080033684a
12a60063185a5
1349402a96450
1423678a879b7
1511da2ae4d72
hex9760054e4d

650151022157 has 16 divisors (see below), whose sum is σ = 803680160640. Its totient is φ = 512158876992.

The previous prime is 650151022121. The next prime is 650151022177. The reversal of 650151022157 is 751220151056.

It is not a de Polignac number, because 650151022157 - 216 = 650150956621 is a prime.

It is a super-2 number, since 2×6501510221572 (a number of 24 digits) contains 22 as substring.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (650151022177) 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 in 15 ways as a sum of consecutive naturals, for example, 15578543 + ... + 15620220.

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

Almost surely, 2650151022157 is an apocalyptic number.

It is an amenable number.

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

650151022157 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 31199012.

The product of its (nonzero) digits is 21000, while the sum is 35.

The spelling of 650151022157 in words is "six hundred fifty billion, one hundred fifty-one million, twenty-two thousand, one hundred fifty-seven".

Divisors: 1 7 13 91 229 1603 2977 20839 31198763 218391341 405583919 2839087433 7144516727 50011617089 92878717451 650151022157