Base | Representation |
---|---|
bin | 100101110101111101110… |
… | …1111110001110011011101 |
3 | 200102020000222021201022002 |
4 | 1023223323233301303131 |
5 | 1140203410303043031 |
6 | 15021211252532045 |
7 | 1044524643562133 |
oct | 113537357616335 |
9 | 20366028251262 |
10 | 5201134034141 |
11 | 1725874629361 |
12 | 700021321025 |
13 | 2b960731c356 |
14 | 13da44305753 |
15 | 90460500ccb |
hex | 4bafbbf1cdd |
5201134034141 has 2 divisors, whose sum is σ = 5201134034142. Its totient is φ = 5201134034140.
The previous prime is 5201134034123. The next prime is 5201134034189. The reversal of 5201134034141 is 1414304311025.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4749113128516 + 452020905625 = 2179246^2 + 672325^2 .
It is a cyclic number.
It is not a de Polignac number, because 5201134034141 - 26 = 5201134034077 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5201134034191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2600567017070 + 2600567017071.
It is an arithmetic number, because the mean of its divisors is an integer number (2600567017071).
Almost surely, 25201134034141 is an apocalyptic number.
It is an amenable number.
5201134034141 is a deficient number, since it is larger than the sum of its proper divisors (1).
5201134034141 is an equidigital number, since it uses as much as digits as its factorization.
5201134034141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5760, while the sum is 29.
Adding to 5201134034141 its reverse (1414304311025), we get a palindrome (6615438345166).
The spelling of 5201134034141 in words is "five trillion, two hundred 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 •