Search a number
-
+
3055772463361 is a prime number
BaseRepresentation
bin101100011101111010001…
…110110111000100000001
3101211010111000222222011021
4230131322032313010001
5400031210222311421
610255445200545441
7433525614242062
oct54357216670401
911733430888137
103055772463361
11a78a44989a02
12414290022281
1319220948c707
14a7c86126569
155474ac78341
hex2c77a3b7101

3055772463361 has 2 divisors, whose sum is σ = 3055772463362. Its totient is φ = 3055772463360.

The previous prime is 3055772463299. The next prime is 3055772463391. The reversal of 3055772463361 is 1633642775503.

3055772463361 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., 3027794883136 + 27977580225 = 1740056^2 + 167265^2 .

It is a cyclic number.

It is not a de Polignac number, because 3055772463361 - 215 = 3055772430593 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 3055772463299 and 3055772463308.

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

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

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

Almost surely, 23055772463361 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 9525600, while the sum is 52.

The spelling of 3055772463361 in words is "three trillion, fifty-five billion, seven hundred seventy-two million, four hundred sixty-three thousand, three hundred sixty-one".