Base | Representation |
---|---|
bin | 1011111111101011001… |
… | …10100101000000111001 |
3 | 1110101210220200102111201 |
4 | 11333311212211000321 |
5 | 23223031430032441 |
6 | 513200254254201 |
7 | 41530162542301 |
oct | 5776546450071 |
9 | 1411726612451 |
10 | 412142424121 |
11 | 14987472135a |
12 | 67a617b7361 |
13 | 2cb3214b69c |
14 | 15d3aa96601 |
15 | aac28edc31 |
hex | 5ff59a5039 |
412142424121 has 2 divisors, whose sum is σ = 412142424122. Its totient is φ = 412142424120.
The previous prime is 412142424079. The next prime is 412142424143. The reversal of 412142424121 is 121424241214.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 314446170025 + 97696254096 = 560755^2 + 312564^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-412142424121 is a prime.
It is a super-2 number, since 2×4121424241212 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 412142424121.
It is not a weakly prime, because it can be changed into another prime (412142424191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 206071212060 + 206071212061.
It is an arithmetic number, because the mean of its divisors is an integer number (206071212061).
Almost surely, 2412142424121 is an apocalyptic number.
It is an amenable number.
412142424121 is a deficient number, since it is larger than the sum of its proper divisors (1).
412142424121 is an equidigital number, since it uses as much as digits as its factorization.
412142424121 is an evil number, because the sum of its binary digits is even.
The product of its digits is 4096, while the sum is 28.
Adding to 412142424121 its reverse (121424241214), we get a palindrome (533566665335).
The spelling of 412142424121 in words is "four hundred twelve billion, one hundred forty-two million, four hundred twenty-four thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •