Search a number
-
+
3661412025569 is a prime number
BaseRepresentation
bin110101010001111101001…
…010011100010011100001
3110222000202002200110121212
4311101331022130103201
5434442032434304234
611442010210355505
7525346126466324
oct65217512342341
913860662613555
103661412025569
1111918836aa011
124b173358bb95
1320736761687c
14c92db3927bb
1565395c825ce
hex3547d29c4e1

3661412025569 has 2 divisors, whose sum is σ = 3661412025570. Its totient is φ = 3661412025568.

The previous prime is 3661412025533. The next prime is 3661412025587. The reversal of 3661412025569 is 9655202141663.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 3661405710400 + 6315169 = 1913480^2 + 2513^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-3661412025569 is a prime.

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

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

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

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

Almost surely, 23661412025569 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 3661412025569 in words is "three trillion, six hundred sixty-one billion, four hundred twelve million, twenty-five thousand, five hundred sixty-nine".