Search a number
-
+
10141401131341 is a prime number
BaseRepresentation
bin1001001110010011101010…
…0111001010100101001101
31022220111201200101222102221
42103210322213022211031
52312124042142200331
633322521222015341
72064456242210524
oct223447247124515
938814650358387
1010141401131341
11325aa42609947
12117957a877551
1358743a0a3bcc
14270bbc8854bb
15128c03b7e711
hex9393a9ca94d

10141401131341 has 2 divisors, whose sum is σ = 10141401131342. Its totient is φ = 10141401131340.

The previous prime is 10141401131327. The next prime is 10141401131369. The reversal of 10141401131341 is 14313110414101.

10141401131341 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 9956681687241 + 184719444100 = 3155421^2 + 429790^2 .

It is a cyclic number.

It is not a de Polignac number, because 10141401131341 - 213 = 10141401123149 is a prime.

It is a congruent number.

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

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

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

Almost surely, 210141401131341 is an apocalyptic number.

It is an amenable number.

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

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

10141401131341 is an evil number, because the sum of its binary digits is even.

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

Adding to 10141401131341 its reverse (14313110414101), we get a palindrome (24454511545442).

The spelling of 10141401131341 in words is "ten trillion, one hundred forty-one billion, four hundred one million, one hundred thirty-one thousand, three hundred forty-one".