Search a number
-
+
5050919100061 is a prime number
BaseRepresentation
bin100100110000000001000…
…1111010001111010011101
3122212212022020101102022001
41021200002033101322131
51130223240242200221
614424205445322301
71030626324653662
oct111400217217235
918785266342261
105050919100061
1116780a017803a
12696a9a706391
132a83b8387283
141366741a5a69
158b5bcb17391
hex498023d1e9d

5050919100061 has 2 divisors, whose sum is σ = 5050919100062. Its totient is φ = 5050919100060.

The previous prime is 5050919099987. The next prime is 5050919100091. The reversal of 5050919100061 is 1600019190505.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 4133471212836 + 917447887225 = 2033094^2 + 957835^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-5050919100061 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 25050919100061 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 5050919100061 in words is "five trillion, fifty billion, nine hundred nineteen million, one hundred thousand, sixty-one".