Search a number
-
+
49030451767369 is a prime number
BaseRepresentation
bin10110010010111110010101…
…01010010010100001001001
320102121021011111002220100201
423021133022222102201021
522411303331123023434
6252140140101532201
713220222205421012
oct1311371252224111
9212537144086321
1049030451767369
111469377488a796
1255ba51b114061
1321487232b77c7
14c1712d608009
155a05dba0e614
hex2c97caa92849

49030451767369 has 2 divisors, whose sum is σ = 49030451767370. Its totient is φ = 49030451767368.

The previous prime is 49030451767327. The next prime is 49030451767483. The reversal of 49030451767369 is 96376715403094.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 30880193430025 + 18150258337344 = 5556995^2 + 4260312^2 .

It is a cyclic number.

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

It is a super-2 number, since 2×490304517673692 (a number of 28 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 49030451767369.

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

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

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

Almost surely, 249030451767369 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 102876480, while the sum is 64.

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