Search a number
-
+
5661665505131 is a prime number
BaseRepresentation
bin101001001100011010110…
…0011111010111101101011
3202001020202012111102011212
41102120311203322331223
51220230042332131011
620012533324343335
71123020230521016
oct122306543727553
922036665442155
105661665505131
11189310a63a839
127753283a4b4b
13320b7b53b33c
1415805178637d
159c41613008b
hex526358faf6b

5661665505131 has 2 divisors, whose sum is σ = 5661665505132. Its totient is φ = 5661665505130.

The previous prime is 5661665505127. The next prime is 5661665505143. The reversal of 5661665505131 is 1315055661665.

5661665505131 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 5661665505131 - 22 = 5661665505127 is a prime.

It is a super-2 number, since 2×56616655051312 (a number of 26 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 5661665505131.

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

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

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

Almost surely, 25661665505131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 2430000, while the sum is 50.

The spelling of 5661665505131 in words is "five trillion, six hundred sixty-one billion, six hundred sixty-five million, five hundred five thousand, one hundred thirty-one".