Search a number
-
+
3332198551963 is a prime number
BaseRepresentation
bin110000011111010110100…
…000101101000110011011
3102210112222122110012212211
4300133112200231012123
5414043320312130323
611030442455215551
7462512662233661
oct60372640550633
912715878405784
103332198551963
1110751a52376a6
124599766775b7
131b22c0369108
14b73ca464c31
155ba28a5e70d
hex307d682d19b

3332198551963 has 2 divisors, whose sum is σ = 3332198551964. Its totient is φ = 3332198551962.

The previous prime is 3332198551937. The next prime is 3332198552077. The reversal of 3332198551963 is 3691558912333.

3332198551963 is digitally balanced in base 2, 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 a de Polignac number, because none of the positive numbers 2k-3332198551963 is a prime.

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

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

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

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

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

Almost surely, 23332198551963 is an apocalyptic number.

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

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

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

The product of its digits is 15746400, while the sum is 58.

The spelling of 3332198551963 in words is "three trillion, three hundred thirty-two billion, one hundred ninety-eight million, five hundred fifty-one thousand, nine hundred sixty-three".