Base | Representation |
---|---|
bin | 100111111110111100000… |
… | …1000101110101101010101 |
3 | 201110100021102102021020201 |
4 | 1033331320020232231111 |
5 | 1210013312323212343 |
6 | 15404255102300501 |
7 | 1105010062320301 |
oct | 117757010565525 |
9 | 21410242367221 |
10 | 5495278725973 |
11 | 18295976409a3 |
12 | 749031887731 |
13 | 30b283042c6a |
14 | 14dd89940d01 |
15 | 97e28b0894d |
hex | 4ff7822eb55 |
5495278725973 has 2 divisors, whose sum is σ = 5495278725974. Its totient is φ = 5495278725972.
The previous prime is 5495278725913. The next prime is 5495278725997. The reversal of 5495278725973 is 3795278725945.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3416312698929 + 2078966027044 = 1848327^2 + 1441862^2 .
It is a cyclic number.
It is not a de Polignac number, because 5495278725973 - 229 = 5494741855061 is a prime.
It is a super-2 number, since 2×54952787259732 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5495278725896 and 5495278725905.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5495278725913) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2747639362986 + 2747639362987.
It is an arithmetic number, because the mean of its divisors is an integer number (2747639362987).
Almost surely, 25495278725973 is an apocalyptic number.
It is an amenable number.
5495278725973 is a deficient number, since it is larger than the sum of its proper divisors (1).
5495278725973 is an equidigital number, since it uses as much as digits as its factorization.
5495278725973 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1333584000, while the sum is 73.
The spelling of 5495278725973 in words is "five trillion, four hundred ninety-five billion, two hundred seventy-eight million, seven hundred twenty-five thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •