Base | Representation |
---|---|
bin | 1000101110011000… |
… | …0111001111001101 |
3 | 20001012221011010212 |
4 | 2023212013033031 |
5 | 14244024233031 |
6 | 1024221412205 |
7 | 112015606502 |
oct | 21346071715 |
9 | 6035834125 |
10 | 2342024141 |
11 | aa2014446 |
12 | 55440a065 |
13 | 2b429a102 |
14 | 18308b4a9 |
15 | da92312b |
hex | 8b9873cd |
2342024141 has 2 divisors, whose sum is σ = 2342024142. Its totient is φ = 2342024140.
The previous prime is 2342024129. The next prime is 2342024143. The reversal of 2342024141 is 1414202432.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2338206025 + 3818116 = 48355^2 + 1954^2 .
It is a cyclic number.
It is not a de Polignac number, because 2342024141 - 214 = 2342007757 is a prime.
Together with 2342024143, 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 (2342024143) 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, 1171012070 + 1171012071.
It is an arithmetic number, because the mean of its divisors is an integer number (1171012071).
Almost surely, 22342024141 is an apocalyptic number.
It is an amenable number.
2342024141 is a deficient number, since it is larger than the sum of its proper divisors (1).
2342024141 is an equidigital number, since it uses as much as digits as its factorization.
2342024141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1536, while the sum is 23.
The square root of 2342024141 is about 48394.4639499189. The cubic root of 2342024141 is about 1327.9970871752.
Adding to 2342024141 its reverse (1414202432), we get a palindrome (3756226573).
The spelling of 2342024141 in words is "two billion, three hundred forty-two million, twenty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •