Search a number
-
+
50066110051453 is a prime number
BaseRepresentation
bin10110110001000111011001…
…01101000111010001111101
320120021021101021212211210001
423120203230231013101331
523030240343133121303
6254252015313114301
713355104610531656
oct1330435455072175
9216237337784701
1050066110051453
1114a52a109a3251
125747192b58991
1321c22a1c9b812
14c512d975652d
155bc5039d831d
hex2d88ecb4747d

50066110051453 has 2 divisors, whose sum is σ = 50066110051454. Its totient is φ = 50066110051452.

The previous prime is 50066110051439. The next prime is 50066110051513. The reversal of 50066110051453 is 35415001166005.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 36908565358564 + 13157544692889 = 6075242^2 + 3627333^2 .

It is a cyclic number.

It is not a de Polignac number, because 50066110051453 - 233 = 50057520116861 is a prime.

It is a super-2 number, since 2×500661100514532 (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 (50066110051403) by changing a digit.

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

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

Almost surely, 250066110051453 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 50066110051453 in words is "fifty trillion, sixty-six billion, one hundred ten million, fifty-one thousand, four hundred fifty-three".