Search a number
-
+
31443101413 is a prime number
BaseRepresentation
bin11101010010001001…
…111010011011100101
310000011022202001100121
4131102021322123211
51003343413221123
622240022441541
72162121644413
oct352211723345
9100138661317
1031443101413
11123758a1529
1261162932b1
132c71354c69
141743d7a2b3
15c4068475d
hex75227a6e5

31443101413 has 2 divisors, whose sum is σ = 31443101414. Its totient is φ = 31443101412.

The previous prime is 31443101411. The next prime is 31443101429. The reversal of 31443101413 is 31410134413.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 31109198884 + 333902529 = 176378^2 + 18273^2 .

It is a cyclic number.

It is not a de Polignac number, because 31443101413 - 21 = 31443101411 is a prime.

It is a super-3 number, since 3×314431014133 (a number of 32 digits) contains 333 as substring.

Together with 31443101411, it forms a pair of twin primes.

It is a congruent number.

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

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

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

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

Almost surely, 231443101413 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1728, while the sum is 25.

Adding to 31443101413 its reverse (31410134413), we get a palindrome (62853235826).

The spelling of 31443101413 in words is "thirty-one billion, four hundred forty-three million, one hundred one thousand, four hundred thirteen".