Search a number
-
+
134401119997 is a prime number
BaseRepresentation
bin111110100101011101…
…1100101011011111101
3110211220122102022021011
41331022323211123331
54200223141314442
6141424254235221
712465404445664
oct1751273453375
9424818368234
10134401119997
1151aa9a23791
122206a7b5b11
13c89b93a551
14670dbd5ddb
15376941e117
hex1f4aee56fd

134401119997 has 2 divisors, whose sum is σ = 134401119998. Its totient is φ = 134401119996.

The previous prime is 134401119949. The next prime is 134401120033. The reversal of 134401119997 is 799911104431.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 108008193316 + 26392926681 = 328646^2 + 162459^2 .

It is a cyclic number.

It is not a de Polignac number, because 134401119997 - 219 = 134400595709 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 134401119997.

It is a congruent number.

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

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

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

Almost surely, 2134401119997 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 244944, while the sum is 49.

The spelling of 134401119997 in words is "one hundred thirty-four billion, four hundred one million, one hundred nineteen thousand, nine hundred ninety-seven".