Search a number
-
+
141107262421 is a prime number
BaseRepresentation
bin1000001101101010100…
…1011111001111010101
3111111020000012122020111
42003122221133033111
54302441424344141
6144453534203021
713123524640426
oct2033251371725
9444200178214
10141107262421
1154930409854
1223420653471
13103ca0b6468
146b886db64d
153a0d03e381
hex20daa5f3d5

141107262421 has 2 divisors, whose sum is σ = 141107262422. Its totient is φ = 141107262420.

The previous prime is 141107262419. The next prime is 141107262463. The reversal of 141107262421 is 124262701141.

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., 136632990321 + 4474272100 = 369639^2 + 66890^2 .

It is a cyclic number.

It is not a de Polignac number, because 141107262421 - 21 = 141107262419 is a prime.

It is a super-3 number, since 3×1411072624213 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

Together with 141107262419, 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 (141107262481) by changing a digit.

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

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

Almost surely, 2141107262421 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5376, while the sum is 31.

Adding to 141107262421 its reverse (124262701141), we get a palindrome (265369963562).

The spelling of 141107262421 in words is "one hundred forty-one billion, one hundred seven million, two hundred sixty-two thousand, four hundred twenty-one".