Base | Representation |
---|---|
bin | 10011010010111110000011… |
… | …00110111111011001010101 |
3 | 12120020120120202201022002211 |
4 | 21221133001212333121111 |
5 | 21030211223404003023 |
6 | 230125320134433421 |
7 | 11636462000015305 |
oct | 1151370146773125 |
9 | 176216522638084 |
10 | 42433230141013 |
11 | 1257a917201008 |
12 | 4913a16b02871 |
13 | 1a8a589ac4caa |
14 | a69aca569605 |
15 | 4d8bbbac0a0d |
hex | 2697c19bf655 |
42433230141013 has 2 divisors, whose sum is σ = 42433230141014. Its totient is φ = 42433230141012.
The previous prime is 42433230141011. The next prime is 42433230141019. The reversal of 42433230141013 is 31014103233424.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 27488031867409 + 14945198273604 = 5242903^2 + 3865902^2 .
It is a cyclic number.
It is not a de Polignac number, because 42433230141013 - 21 = 42433230141011 is a prime.
Together with 42433230141011, 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 (42433230141011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21216615070506 + 21216615070507.
It is an arithmetic number, because the mean of its divisors is an integer number (21216615070507).
Almost surely, 242433230141013 is an apocalyptic number.
It is an amenable number.
42433230141013 is a deficient number, since it is larger than the sum of its proper divisors (1).
42433230141013 is an equidigital number, since it uses as much as digits as its factorization.
42433230141013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 20736, while the sum is 31.
Adding to 42433230141013 its reverse (31014103233424), we get a palindrome (73447333374437).
The spelling of 42433230141013 in words is "forty-two trillion, four hundred thirty-three billion, two hundred thirty million, one hundred forty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •