Search a number
-
+
50275450983671 is a prime number
BaseRepresentation
bin10110110111001101010100…
…11001011001010011110111
320121000021201121210001100222
423123212222121121103313
523042203110422434141
6254532120123524555
713406165354226344
oct1333465231312367
9217007647701328
1050275450983671
1115023776447041
12577b87698975b
132208c5459aa04
14c5b4b82397cb
155c2ba703114b
hex2db9aa6594f7

50275450983671 has 2 divisors, whose sum is σ = 50275450983672. Its totient is φ = 50275450983670.

The previous prime is 50275450983613. The next prime is 50275450983763. The reversal of 50275450983671 is 17638905457205.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 50275450983671 - 218 = 50275450721527 is a prime.

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

It is a congruent number.

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

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

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

It is a 1-persistent number, because it is pandigital, but 2⋅50275450983671 = 100550901967342 is not.

Almost surely, 250275450983671 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 63504000, while the sum is 62.

The spelling of 50275450983671 in words is "fifty trillion, two hundred seventy-five billion, four hundred fifty million, nine hundred eighty-three thousand, six hundred seventy-one".