Base | Representation |
---|---|
bin | 100100100100111100111… |
… | …0110001011110010101101 |
3 | 122210120222010220000122002 |
4 | 1021021321312023302231 |
5 | 1124331103412433113 |
6 | 14405235451302045 |
7 | 1026125416545605 |
oct | 111117166136255 |
9 | 18716863800562 |
10 | 5027155983533 |
11 | 1669006549962 |
12 | 69236844a925 |
13 | 2a609c18a388 |
14 | 13545c1cdc05 |
15 | 8ab7b818c58 |
hex | 49279d8bcad |
5027155983533 has 2 divisors, whose sum is σ = 5027155983534. Its totient is φ = 5027155983532.
The previous prime is 5027155983527. The next prime is 5027155983583. The reversal of 5027155983533 is 3353895517205.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3124681976329 + 1902474007204 = 1767677^2 + 1379302^2 .
It is a cyclic number.
It is not a de Polignac number, because 5027155983533 - 226 = 5027088874669 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5027155983583) 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, 2513577991766 + 2513577991767.
It is an arithmetic number, because the mean of its divisors is an integer number (2513577991767).
Almost surely, 25027155983533 is an apocalyptic number.
It is an amenable number.
5027155983533 is a deficient number, since it is larger than the sum of its proper divisors (1).
5027155983533 is an equidigital number, since it uses as much as digits as its factorization.
5027155983533 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17010000, while the sum is 56.
The spelling of 5027155983533 in words is "five trillion, twenty-seven billion, one hundred fifty-five million, nine hundred eighty-three thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •