Base | Representation |
---|---|
bin | 100010000110011101101… |
… | …001101011010010000101 |
3 | 22022000201201112020112212 |
4 | 202012131221223102011 |
5 | 301343241420440141 |
6 | 4552313304153205 |
7 | 331206455254331 |
oct | 42063551532205 |
9 | 8260651466485 |
10 | 2343402124421 |
11 | 8239164525a6 |
12 | 31a200768805 |
13 | 13cc9c2332b7 |
14 | 815c7d607c1 |
15 | 40e55b9a2eb |
hex | 2219da6b485 |
2343402124421 has 2 divisors, whose sum is σ = 2343402124422. Its totient is φ = 2343402124420.
The previous prime is 2343402124381. The next prime is 2343402124463. The reversal of 2343402124421 is 1244212043432.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1378123384225 + 965278740196 = 1173935^2 + 982486^2 .
It is a cyclic number.
It is not a de Polignac number, because 2343402124421 - 214 = 2343402108037 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2343402124121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1171701062210 + 1171701062211.
It is an arithmetic number, because the mean of its divisors is an integer number (1171701062211).
Almost surely, 22343402124421 is an apocalyptic number.
It is an amenable number.
2343402124421 is a deficient number, since it is larger than the sum of its proper divisors (1).
2343402124421 is an equidigital number, since it uses as much as digits as its factorization.
2343402124421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36864, while the sum is 32.
Adding to 2343402124421 its reverse (1244212043432), we get a palindrome (3587614167853).
The spelling of 2343402124421 in words is "two trillion, three hundred forty-three billion, four hundred two million, one hundred twenty-four thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •