Search a number
BaseRepresentation
bin111010111101000111010…
…010010001010011110101
3112100022020120000200102022
4322331013102101103311
51012334131113210312
612341055313322525
7565462142633462
oct72750722212365
915308216020368
104051350131957
111322193592857
12555218b66445
1323506b4a68bb
1410012d0c0669
15705b9144172
hex3af474914f5

4051350131957 has 2 divisors, whose sum is σ = 4051350131958. Its totient is φ = 4051350131956.

The previous prime is 4051350131867. The next prime is 4051350132001. The reversal of 4051350131957 is 7591310531504.

It is an a-pointer prime, because the next prime (4051350132001) can be obtained adding 4051350131957 to its sum of digits (44).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 3772894451236 + 278455680721 = 1942394^2 + 527689^2 .

It is a cyclic number.

It is not a de Polignac number, because 4051350131957 - 218 = 4051349869813 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 24051350131957 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 283500, while the sum is 44.

The spelling of 4051350131957 in words is "four trillion, fifty-one billion, three hundred fifty million, one hundred thirty-one thousand, nine hundred fifty-seven".