Search a number
-
+
126146525369 is a prime number
BaseRepresentation
bin111010101111011101…
…0110011100010111001
3110001121100221110012012
41311132322303202321
54031322002302434
6133541221455305
712054012526304
oct1653672634271
9401540843165
10126146525369
1149553474657
1220546271535
13bb84736627
1461697b7b3b
1534348d33ce
hex1d5eeb38b9

126146525369 has 2 divisors, whose sum is σ = 126146525370. Its totient is φ = 126146525368.

The previous prime is 126146525363. The next prime is 126146525377. The reversal of 126146525369 is 963525641621.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 93949606144 + 32196919225 = 306512^2 + 179435^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-126146525369 is a prime.

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

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

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

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

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

Almost surely, 2126146525369 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 2332800, while the sum is 50.

The spelling of 126146525369 in words is "one hundred twenty-six billion, one hundred forty-six million, five hundred twenty-five thousand, three hundred sixty-nine".