Base | Representation |
---|---|
bin | 10011000110101111100100… |
… | …10011010010100000110101 |
3 | 12111202102020222111111011112 |
4 | 21203113302103102200311 |
5 | 21001320402401440023 |
6 | 225204323054444405 |
7 | 11564230532002241 |
oct | 1143276223224065 |
9 | 174672228444145 |
10 | 42013140265013 |
11 | 12428744443505 |
12 | 4866517803705 |
13 | 1a59a8c2a1678 |
14 | a536381a7421 |
15 | 4cccd1606478 |
hex | 2635f24d2835 |
42013140265013 has 2 divisors, whose sum is σ = 42013140265014. Its totient is φ = 42013140265012.
The previous prime is 42013140264971. The next prime is 42013140265051. The reversal of 42013140265013 is 31056204131024.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 41485682319844 + 527457945169 = 6440938^2 + 726263^2 .
It is a cyclic number.
It is not a de Polignac number, because 42013140265013 - 240 = 40913628637237 is a prime.
It is a super-2 number, since 2×420131402650132 (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 (42013140267013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21006570132506 + 21006570132507.
It is an arithmetic number, because the mean of its divisors is an integer number (21006570132507).
Almost surely, 242013140265013 is an apocalyptic number.
It is an amenable number.
42013140265013 is a deficient number, since it is larger than the sum of its proper divisors (1).
42013140265013 is an equidigital number, since it uses as much as digits as its factorization.
42013140265013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 17280, while the sum is 32.
Adding to 42013140265013 its reverse (31056204131024), we get a palindrome (73069344396037).
The spelling of 42013140265013 in words is "forty-two trillion, thirteen billion, one hundred forty million, two hundred sixty-five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •