Base | Representation |
---|---|
bin | 111110011010011101010… |
… | …010001001110100100101 |
3 | 120012000200220112222122222 |
4 | 332122131102021310211 |
5 | 1030232401113040031 |
6 | 13042202525002125 |
7 | 621604550456252 |
oct | 76323522116445 |
9 | 16160626488588 |
10 | 4289016143141 |
11 | 1403a63886714 |
12 | 5932a69b3345 |
13 | 2515b6162752 |
14 | 10b8377b4429 |
15 | 76879217e7b |
hex | 3e69d489d25 |
4289016143141 has 2 divisors, whose sum is σ = 4289016143142. Its totient is φ = 4289016143140.
The previous prime is 4289016143053. The next prime is 4289016143149. The reversal of 4289016143141 is 1413416109824.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4173558899041 + 115457244100 = 2042929^2 + 339790^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4289016143141 is a prime.
It is a super-2 number, since 2×42890161431412 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4289016143092 and 4289016143101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4289016143149) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2144508071570 + 2144508071571.
It is an arithmetic number, because the mean of its divisors is an integer number (2144508071571).
Almost surely, 24289016143141 is an apocalyptic number.
It is an amenable number.
4289016143141 is a deficient number, since it is larger than the sum of its proper divisors (1).
4289016143141 is an equidigital number, since it uses as much as digits as its factorization.
4289016143141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 165888, while the sum is 44.
The spelling of 4289016143141 in words is "four trillion, two hundred eighty-nine billion, sixteen million, one hundred forty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •