Base | Representation |
---|---|
bin | 100101011001100101111… |
… | …0110111001000001101101 |
3 | 200012101202110010102012212 |
4 | 1022303023312321001231 |
5 | 1133204112432101341 |
6 | 14533213055340205 |
7 | 1040236655011526 |
oct | 112631366710155 |
9 | 20171673112185 |
10 | 5140201050221 |
11 | 1701a46540706 |
12 | 6b0256b21665 |
13 | 2b39464ba593 |
14 | 13ab0398b84d |
15 | 8da95e085eb |
hex | 4accbdb906d |
5140201050221 has 2 divisors, whose sum is σ = 5140201050222. Its totient is φ = 5140201050220.
The previous prime is 5140201050181. The next prime is 5140201050251. The reversal of 5140201050221 is 1220501020415.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4819407949225 + 320793100996 = 2195315^2 + 566386^2 .
It is a cyclic number.
It is not a de Polignac number, because 5140201050221 - 234 = 5123021181037 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5140201050251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2570100525110 + 2570100525111.
It is an arithmetic number, because the mean of its divisors is an integer number (2570100525111).
Almost surely, 25140201050221 is an apocalyptic number.
It is an amenable number.
5140201050221 is a deficient number, since it is larger than the sum of its proper divisors (1).
5140201050221 is an equidigital number, since it uses as much as digits as its factorization.
5140201050221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 800, while the sum is 23.
Adding to 5140201050221 its reverse (1220501020415), we get a palindrome (6360702070636).
The spelling of 5140201050221 in words is "five trillion, one hundred forty billion, two hundred one million, fifty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •