Base | Representation |
---|---|
bin | 1001011110100010000011… |
… | …1100100101000101010101 |
3 | 1100220011012201011221201111 |
4 | 2113220200330211011111 |
5 | 2331210423203132131 |
6 | 34054540420255021 |
7 | 2123554603411543 |
oct | 227504074450525 |
9 | 40804181157644 |
10 | 10420143411541 |
11 | 3358181337676 |
12 | 12035b0b41471 |
13 | 5a77ccaa4596 |
14 | 2804a2668d93 |
15 | 1310b9e84ab1 |
hex | 97a20f25155 |
10420143411541 has 2 divisors, whose sum is σ = 10420143411542. Its totient is φ = 10420143411540.
The previous prime is 10420143411523. The next prime is 10420143411551. The reversal of 10420143411541 is 14511434102401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8707539329316 + 1712604082225 = 2950854^2 + 1308665^2 .
It is an emirp because it is prime and its reverse (14511434102401) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10420143411541 - 235 = 10385783673173 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10420143411551) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5210071705770 + 5210071705771.
It is an arithmetic number, because the mean of its divisors is an integer number (5210071705771).
Almost surely, 210420143411541 is an apocalyptic number.
It is an amenable number.
10420143411541 is a deficient number, since it is larger than the sum of its proper divisors (1).
10420143411541 is an equidigital number, since it uses as much as digits as its factorization.
10420143411541 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7680, while the sum is 31.
Adding to 10420143411541 its reverse (14511434102401), we get a palindrome (24931577513942).
The spelling of 10420143411541 in words is "ten trillion, four hundred twenty billion, one hundred forty-three million, four hundred eleven thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •