Base | Representation |
---|---|
bin | 1000001110110110011… |
… | …0000001010111100101 |
3 | 111112001011022111212212 |
4 | 2003231212001113211 |
5 | 4304114312330431 |
6 | 144545251053205 |
7 | 13134434456162 |
oct | 2035546012745 |
9 | 445034274785 |
10 | 141425120741 |
11 | 54a83880483 |
12 | 234aaba1205 |
13 | 1044abc78c8 |
14 | 6bb89dd069 |
15 | 3a2adc972b |
hex | 20ed9815e5 |
141425120741 has 2 divisors, whose sum is σ = 141425120742. Its totient is φ = 141425120740.
The previous prime is 141425120723. The next prime is 141425120743. The reversal of 141425120741 is 147021524141.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 137600193025 + 3824927716 = 370945^2 + 61846^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-141425120741 is a prime.
Together with 141425120743, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 141425120698 and 141425120707.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (141425120743) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70712560370 + 70712560371.
It is an arithmetic number, because the mean of its divisors is an integer number (70712560371).
Almost surely, 2141425120741 is an apocalyptic number.
It is an amenable number.
141425120741 is a deficient number, since it is larger than the sum of its proper divisors (1).
141425120741 is an equidigital number, since it uses as much as digits as its factorization.
141425120741 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8960, while the sum is 32.
Adding to 141425120741 its reverse (147021524141), we get a palindrome (288446644882).
The spelling of 141425120741 in words is "one hundred forty-one billion, four hundred twenty-five million, one hundred twenty thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •