Search a number
-
+
48972495611267 is a prime number
BaseRepresentation
bin10110010001010010011000…
…01101000110010110000011
320102101201120102101010100122
423020221030031012112003
522404331132334030032
6252053353124210455
713213101044262614
oct1310511415062603
9212351512333318
1048972495611267
1114671134075918
1255ab245839a2b
132143118116007
14c143d2383c0b
1559dd48930012
hex2c8a4c346583

48972495611267 has 2 divisors, whose sum is σ = 48972495611268. Its totient is φ = 48972495611266.

The previous prime is 48972495611203. The next prime is 48972495611287. The reversal of 48972495611267 is 76211659427984.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 48972495611267 - 26 = 48972495611203 is a prime.

It is a super-3 number, since 3×489724956112673 (a number of 42 digits) contains 333 as substring.

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

It is not a weakly prime, because it can be changed into another prime (48972495611287) 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, 24486247805633 + 24486247805634.

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

Almost surely, 248972495611267 is an apocalyptic number.

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

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

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

The product of its digits is 365783040, while the sum is 71.

The spelling of 48972495611267 in words is "forty-eight trillion, nine hundred seventy-two billion, four hundred ninety-five million, six hundred eleven thousand, two hundred sixty-seven".