Base | Representation |
---|---|
bin | 101000000001001001001… |
… | …0101001111001011110101 |
3 | 201110210111101010102201102 |
4 | 1100002102111033023311 |
5 | 1210103011333222022 |
6 | 15410400550135445 |
7 | 1105235311443224 |
oct | 120022225171365 |
9 | 21423441112642 |
10 | 5500013179637 |
11 | 18305a7067019 |
12 | 749b33351585 |
13 | 30b858b77c32 |
14 | 1502b863acbb |
15 | 981045a9a92 |
hex | 5009254f2f5 |
5500013179637 has 2 divisors, whose sum is σ = 5500013179638. Its totient is φ = 5500013179636.
The previous prime is 5500013179589. The next prime is 5500013179669. The reversal of 5500013179637 is 7369713100055.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3458655184516 + 2041357995121 = 1859746^2 + 1428761^2 .
It is a cyclic number.
It is not a de Polignac number, because 5500013179637 - 224 = 5499996402421 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5500013179591 and 5500013179600.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5500013179937) 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, 2750006589818 + 2750006589819.
It is an arithmetic number, because the mean of its divisors is an integer number (2750006589819).
Almost surely, 25500013179637 is an apocalyptic number.
It is an amenable number.
5500013179637 is a deficient number, since it is larger than the sum of its proper divisors (1).
5500013179637 is an equidigital number, since it uses as much as digits as its factorization.
5500013179637 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 595350, while the sum is 47.
The spelling of 5500013179637 in words is "five trillion, five hundred billion, thirteen million, one hundred seventy-nine thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •