Search a number
-
+
3301040020477 is a prime number
BaseRepresentation
bin110000000010010101010…
…100010101101111111101
3102200120120011011211002011
4300002111110111233331
5413041012221123402
611004250555531221
7460330564132213
oct60022524255775
912616504154064
103301040020477
111062a66040831
1245391b759b11
131ac395c6b934
14b5ab2202cb3
155ad0338bed7
hex30095515bfd

3301040020477 has 2 divisors, whose sum is σ = 3301040020478. Its totient is φ = 3301040020476.

The previous prime is 3301040020441. The next prime is 3301040020483. The reversal of 3301040020477 is 7740200401033.

3301040020477 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., 2954706593476 + 346333427001 = 1718926^2 + 588501^2 .

It is an emirp because it is prime and its reverse (7740200401033) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 3301040020477 - 227 = 3300905802749 is a prime.

It is a congruent number.

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

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

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

Almost surely, 23301040020477 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 14112, while the sum is 31.

The spelling of 3301040020477 in words is "three trillion, three hundred one billion, forty million, twenty thousand, four hundred seventy-seven".