Base | Representation |
---|---|
bin | 100100011101000000010… |
… | …0111101001010100000101 |
3 | 122201221220202202012122101 |
4 | 1020322000213221110011 |
5 | 1124041130433243441 |
6 | 14353334202432101 |
7 | 1024652460111244 |
oct | 110720047512405 |
9 | 18657822665571 |
10 | 5010089743621 |
11 | 1661849058256 |
12 | 68aba4b02631 |
13 | 2a45ac543a71 |
14 | 1346bd7ca95b |
15 | 8a4cd40a231 |
hex | 48e809e9505 |
5010089743621 has 2 divisors, whose sum is σ = 5010089743622. Its totient is φ = 5010089743620.
The previous prime is 5010089743513. The next prime is 5010089743651. The reversal of 5010089743621 is 1263479800105.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4731120912996 + 278968830625 = 2175114^2 + 528175^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5010089743621 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5010089743651) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2505044871810 + 2505044871811.
It is an arithmetic number, because the mean of its divisors is an integer number (2505044871811).
It is a 1-persistent number, because it is pandigital, but 2⋅5010089743621 = 10020179487242 is not.
Almost surely, 25010089743621 is an apocalyptic number.
It is an amenable number.
5010089743621 is a deficient number, since it is larger than the sum of its proper divisors (1).
5010089743621 is an equidigital number, since it uses as much as digits as its factorization.
5010089743621 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 362880, while the sum is 46.
The spelling of 5010089743621 in words is "five trillion, ten billion, eighty-nine million, seven hundred forty-three thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •