Base | Representation |
---|---|
bin | 10011001010011111110001… |
… | …11111000001010011000101 |
3 | 12112012202010111122111000021 |
4 | 21211033320333001103011 |
5 | 21010424010430123023 |
6 | 225343451503415141 |
7 | 11606444362442602 |
oct | 1145177077012305 |
9 | 175182114574007 |
10 | 42142101411013 |
11 | 1247840167120a |
12 | 48875085b44b1 |
13 | 1a68ca1b83c96 |
14 | a5998d6cd6a9 |
15 | 4d132d16135d |
hex | 2653f8fc14c5 |
42142101411013 has 2 divisors, whose sum is σ = 42142101411014. Its totient is φ = 42142101411012.
The previous prime is 42142101410993. The next prime is 42142101411019. The reversal of 42142101411013 is 31011410124124.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 29041299444004 + 13100801967009 = 5388998^2 + 3619503^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-42142101411013 is a prime.
It is a super-2 number, since 2×421421014110132 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (42142101411019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21071050705506 + 21071050705507.
It is an arithmetic number, because the mean of its divisors is an integer number (21071050705507).
Almost surely, 242142101411013 is an apocalyptic number.
It is an amenable number.
42142101411013 is a deficient number, since it is larger than the sum of its proper divisors (1).
42142101411013 is an equidigital number, since it uses as much as digits as its factorization.
42142101411013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 768, while the sum is 25.
Adding to 42142101411013 its reverse (31011410124124), we get a palindrome (73153511535137).
The spelling of 42142101411013 in words is "forty-two trillion, one hundred forty-two billion, one hundred one million, four hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •