Search a number
-
+
19490104261 is a prime number
BaseRepresentation
bin10010001001101100…
…110110001111000101
31212022022001212210101
4102021230312033011
5304403431314021
612541552324101
71256661103255
oct221154661705
955268055711
1019490104261
1182a1723891
12393b243631
131ab7b69594
14d2c6b5965
157910eaa91
hex489b363c5

19490104261 has 2 divisors, whose sum is σ = 19490104262. Its totient is φ = 19490104260.

The previous prime is 19490104241. The next prime is 19490104267. The reversal of 19490104261 is 16240109491.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 19458576036 + 31528225 = 139494^2 + 5615^2 .

It is a cyclic number.

It is not a de Polignac number, because 19490104261 - 29 = 19490103749 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 19490104261.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (19490104267) 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 as a sum of consecutive naturals, namely, 9745052130 + 9745052131.

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

Almost surely, 219490104261 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 19490104261 in words is "nineteen billion, four hundred ninety million, one hundred four thousand, two hundred sixty-one".