Base | Representation |
---|---|
bin | 100111011001010011… |
… | …010100000011100101 |
3 | 11001011222201012112222 |
4 | 213121103110003211 |
5 | 1143112402040141 |
6 | 31233232522125 |
7 | 3025146450353 |
oct | 473123240345 |
9 | 131158635488 |
10 | 42300424421 |
11 | 16a37539a52 |
12 | 82463b0345 |
13 | 3cb1845948 |
14 | 2093d0a7d3 |
15 | 117893e14b |
hex | 9d94d40e5 |
42300424421 has 2 divisors, whose sum is σ = 42300424422. Its totient is φ = 42300424420.
The previous prime is 42300424399. The next prime is 42300424423. The reversal of 42300424421 is 12442400324.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 36802201921 + 5498222500 = 191839^2 + 74150^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-42300424421 is a prime.
Together with 42300424423, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (42300424423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21150212210 + 21150212211.
It is an arithmetic number, because the mean of its divisors is an integer number (21150212211).
Almost surely, 242300424421 is an apocalyptic number.
It is an amenable number.
42300424421 is a deficient number, since it is larger than the sum of its proper divisors (1).
42300424421 is an equidigital number, since it uses as much as digits as its factorization.
42300424421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6144, while the sum is 26.
Adding to 42300424421 its reverse (12442400324), we get a palindrome (54742824745).
The spelling of 42300424421 in words is "forty-two billion, three hundred million, four hundred twenty-four thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •