Base | Representation |
---|---|
bin | 100001010000100110011… |
… | …0100100000000011011101 |
3 | 121011222220012010202102202 |
4 | 1002201030310200003131 |
5 | 1044343140303043031 |
6 | 13415541110301245 |
7 | 651152651125223 |
oct | 102411464400335 |
9 | 17158805122382 |
10 | 4571134034141 |
11 | 1502674aa1834 |
12 | 619abb657825 |
13 | 2720962c9a6c |
14 | 11b35ba16b13 |
15 | 7dd8ba592cb |
hex | 4284cd200dd |
4571134034141 has 2 divisors, whose sum is σ = 4571134034142. Its totient is φ = 4571134034140.
The previous prime is 4571134034111. The next prime is 4571134034147. The reversal of 4571134034141 is 1414304311754.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4329537208516 + 241596825625 = 2080754^2 + 491525^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4571134034141 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4571134034095 and 4571134034104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4571134034147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2285567017070 + 2285567017071.
It is an arithmetic number, because the mean of its divisors is an integer number (2285567017071).
Almost surely, 24571134034141 is an apocalyptic number.
It is an amenable number.
4571134034141 is a deficient number, since it is larger than the sum of its proper divisors (1).
4571134034141 is an equidigital number, since it uses as much as digits as its factorization.
4571134034141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 80640, while the sum is 38.
Adding to 4571134034141 its reverse (1414304311754), we get a palindrome (5985438345895).
The spelling of 4571134034141 in words is "four trillion, five hundred seventy-one billion, one hundred thirty-four million, thirty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •