Search a number
-
+
16948495261 is a prime number
BaseRepresentation
bin11111100100011010…
…11000001110011101
31121202011120202200201
433302031120032131
5234202303322021
611441441023501
71136666555425
oct176215301635
947664522621
1016948495261
117207a90385
123350024b91
1317a142c129
14b6ad13485
15692e01591
hex3f235839d

16948495261 has 2 divisors, whose sum is σ = 16948495262. Its totient is φ = 16948495260.

The previous prime is 16948495241. The next prime is 16948495331. The reversal of 16948495261 is 16259484961.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 12023122500 + 4925372761 = 109650^2 + 70181^2 .

It is an emirp because it is prime and its reverse (16259484961) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 16948495261 - 27 = 16948495133 is a prime.

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

It is a congruent number.

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

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

Almost surely, 216948495261 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 3732480, while the sum is 55.

The spelling of 16948495261 in words is "sixteen billion, nine hundred forty-eight million, four hundred ninety-five thousand, two hundred sixty-one".