Base | Representation |
---|---|
bin | 1011001110010101111101… |
… | …1111110011100010000111 |
3 | 1121200210101112001110021001 |
4 | 2303211133133303202013 |
5 | 3104143424030330341 |
6 | 42125221425434131 |
7 | 2412416361343306 |
oct | 263453737634207 |
9 | 47623345043231 |
10 | 12341043214471 |
11 | 3a28897189664 |
12 | 147393a49b947 |
13 | 6b69a875b8ca |
14 | 309449a8843d |
15 | 166043981d31 |
hex | b395f7f3887 |
12341043214471 has 2 divisors, whose sum is σ = 12341043214472. Its totient is φ = 12341043214470.
The previous prime is 12341043214387. The next prime is 12341043214523. The reversal of 12341043214471 is 17441234014321.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 12341043214471 - 223 = 12341034825863 is a prime.
It is a super-4 number, since 4×123410432144714 (a number of 53 digits) contains 4444 as substring. Note that it is a super-d number also for d = 3.
It is a self number, because there is not a number n which added to its sum of digits gives 12341043214471.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12341043217471) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6170521607235 + 6170521607236.
It is an arithmetic number, because the mean of its divisors is an integer number (6170521607236).
Almost surely, 212341043214471 is an apocalyptic number.
12341043214471 is a deficient number, since it is larger than the sum of its proper divisors (1).
12341043214471 is an equidigital number, since it uses as much as digits as its factorization.
12341043214471 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64512, while the sum is 37.
Adding to 12341043214471 its reverse (17441234014321), we get a palindrome (29782277228792).
The spelling of 12341043214471 in words is "twelve trillion, three hundred forty-one billion, forty-three million, two hundred fourteen thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •