Search a number
-
+
1370679675433 is a prime number
BaseRepresentation
bin10011111100100010111…
…000000000101000101001
311212000222000121222111221
4103330202320000220221
5134424122444103213
62525403114222041
7201012502002145
oct23744270005051
94760860558457
101370679675433
11489335a414a2
121a1791a24921
139c3402b60b3
144a4ac568225
15259c404138d
hex13f22e00a29

1370679675433 has 2 divisors, whose sum is σ = 1370679675434. Its totient is φ = 1370679675432.

The previous prime is 1370679675427. The next prime is 1370679675509. The reversal of 1370679675433 is 3345769760731.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 694135589904 + 676544085529 = 833148^2 + 822523^2 .

It is a cyclic number.

It is not a de Polignac number, because 1370679675433 - 233 = 1362089740841 is a prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 21370679675433 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 60011280, while the sum is 61.

The spelling of 1370679675433 in words is "one trillion, three hundred seventy billion, six hundred seventy-nine million, six hundred seventy-five thousand, four hundred thirty-three".