Search a number
-
+
4666805513569 is a prime number
BaseRepresentation
bin100001111101001001101…
…0010001110110101100001
3121112010211200220110201201
41003322103102032311201
51102430104202413234
613531522330201201
7661110535233223
oct103722322166541
917463750813651
104666805513569
11153a1aa05a301
1263455b883201
1327b102112514
14121c35c48413
15815dac79314
hex43e9348ed61

4666805513569 has 2 divisors, whose sum is σ = 4666805513570. Its totient is φ = 4666805513568.

The previous prime is 4666805513567. The next prime is 4666805513593. The reversal of 4666805513569 is 9653155086664.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 4251184185600 + 415621327969 = 2061840^2 + 644687^2 .

It is a cyclic number.

It is not a de Polignac number, because 4666805513569 - 21 = 4666805513567 is a prime.

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

Together with 4666805513567, it forms a pair of twin primes.

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

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

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

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

Almost surely, 24666805513569 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 4666805513569 in words is "four trillion, six hundred sixty-six billion, eight hundred five million, five hundred thirteen thousand, five hundred sixty-nine".