Search a number
-
+
654045111047 is a prime number
BaseRepresentation
bin10011000010010000010…
…00000110001100000111
32022112012112021011021202
421201020020012030013
541203441022023142
61220244132333115
765152563500306
oct11411010061407
92275175234252
10654045111047
11232419461429
12a691247419b
13498a3784963
1423927d0c43d
151202e8e9032
hex9848206307

654045111047 has 2 divisors, whose sum is σ = 654045111048. Its totient is φ = 654045111046.

The previous prime is 654045110987. The next prime is 654045111053. The reversal of 654045111047 is 740111540456.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 654045111047 - 232 = 649750143751 is a prime.

It is a super-2 number, since 2×6540451110472 (a number of 24 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 654045111047.

It is a congruent number.

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

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

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

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

Almost surely, 2654045111047 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 67200, while the sum is 38.

The spelling of 654045111047 in words is "six hundred fifty-four billion, forty-five million, one hundred eleven thousand, forty-seven".