Base | Representation |
---|---|
bin | 111101100111010110000… |
… | …101000101010010000101 |
3 | 112222210001002221202120102 |
4 | 331213112011011102011 |
5 | 1023333001404140031 |
6 | 13001045015413445 |
7 | 614622540640061 |
oct | 75472605052205 |
9 | 15883032852512 |
10 | 4234134443141 |
11 | 1392760567159 |
12 | 58472b084285 |
13 | 24937ac14355 |
14 | 108d0c9b8aa1 |
15 | 75215ed87cb |
hex | 3d9d6145485 |
4234134443141 has 2 divisors, whose sum is σ = 4234134443142. Its totient is φ = 4234134443140.
The previous prime is 4234134443093. The next prime is 4234134443153. The reversal of 4234134443141 is 1413444314324.
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., 2526656486116 + 1707477957025 = 1589546^2 + 1306705^2 .
It is a cyclic number.
It is not a de Polignac number, because 4234134443141 - 210 = 4234134442117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4234134443095 and 4234134443104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4234134443741) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2117067221570 + 2117067221571.
It is an arithmetic number, because the mean of its divisors is an integer number (2117067221571).
Almost surely, 24234134443141 is an apocalyptic number.
It is an amenable number.
4234134443141 is a deficient number, since it is larger than the sum of its proper divisors (1).
4234134443141 is an equidigital number, since it uses as much as digits as its factorization.
4234134443141 is an evil number, because the sum of its binary digits is even.
The product of its digits is 221184, while the sum is 38.
Adding to 4234134443141 its reverse (1413444314324), we get a palindrome (5647578757465).
The spelling of 4234134443141 in words is "four trillion, two hundred thirty-four billion, one hundred thirty-four million, four hundred forty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •