Base | Representation |
---|---|
bin | 100111111000011011001… |
… | …0000100010001101001001 |
3 | 201102000011102110220022101 |
4 | 1033300312100202031021 |
5 | 1204301134333330034 |
6 | 15354022540553401 |
7 | 1104003304065451 |
oct | 117606620421511 |
9 | 21360142426271 |
10 | 5481288573769 |
11 | 1823668559538 |
12 | 746388552861 |
13 | 309b637a15a8 |
14 | 14d41d8acd61 |
15 | 978aa7bd514 |
hex | 4fc36422349 |
5481288573769 has 2 divisors, whose sum is σ = 5481288573770. Its totient is φ = 5481288573768.
The previous prime is 5481288573763. The next prime is 5481288573773. The reversal of 5481288573769 is 9673758821845.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4853054791225 + 628233782544 = 2202965^2 + 792612^2 .
It is a cyclic number.
It is not a de Polignac number, because 5481288573769 - 225 = 5481255019337 is a prime.
It is a super-2 number, since 2×54812885737692 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5481288573763) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2740644286884 + 2740644286885.
It is an arithmetic number, because the mean of its divisors is an integer number (2740644286885).
Almost surely, 25481288573769 is an apocalyptic number.
It is an amenable number.
5481288573769 is a deficient number, since it is larger than the sum of its proper divisors (1).
5481288573769 is an equidigital number, since it uses as much as digits as its factorization.
5481288573769 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 812851200, while the sum is 73.
The spelling of 5481288573769 in words is "five trillion, four hundred eighty-one billion, two hundred eighty-eight million, five hundred seventy-three thousand, seven hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •