Search a number
-
+
31341375474469 is a prime number
BaseRepresentation
bin1110010000001001110111…
…00011010100101100100101
311002222012120100022002110121
413020010323203110230211
513101444114110140334
6150354010142521541
76413224333656214
oct710047343245445
9132865510262417
1031341375474469
119a93891429645
1236222032962b1
13146462c55b458
147a4d05a6d07b
153953db333db4
hex1c813b8d4b25

31341375474469 has 2 divisors, whose sum is σ = 31341375474470. Its totient is φ = 31341375474468.

The previous prime is 31341375474413. The next prime is 31341375474517. The reversal of 31341375474469 is 96447457314313.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 22458215780100 + 8883159694369 = 4739010^2 + 2980463^2 .

It is a cyclic number.

It is not a de Polignac number, because 31341375474469 - 219 = 31341374950181 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 231341375474469 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 91445760, while the sum is 61.

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