Base | Representation |
---|---|
bin | 101000000001011001010… |
… | …0010001100110011010101 |
3 | 201110211220000201221111021 |
4 | 1100002302202030303111 |
5 | 1210110113140324121 |
6 | 15410530330041141 |
7 | 1105254561605455 |
oct | 120026242146325 |
9 | 21424800657437 |
10 | 5500553448661 |
11 | 1830854028147 |
12 | 74a0642791b1 |
13 | 30b913a8c14b |
14 | 15032a2b5d65 |
15 | 98136c29641 |
hex | 500b288ccd5 |
5500553448661 has 2 divisors, whose sum is σ = 5500553448662. Its totient is φ = 5500553448660.
The previous prime is 5500553448647. The next prime is 5500553448763. The reversal of 5500553448661 is 1668443550055.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3721064148036 + 1779489300625 = 1929006^2 + 1333975^2 .
It is a cyclic number.
It is not a de Polignac number, because 5500553448661 - 29 = 5500553448149 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5500553448599 and 5500553448608.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5500553448601) 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, 2750276724330 + 2750276724331.
It is an arithmetic number, because the mean of its divisors is an integer number (2750276724331).
Almost surely, 25500553448661 is an apocalyptic number.
It is an amenable number.
5500553448661 is a deficient number, since it is larger than the sum of its proper divisors (1).
5500553448661 is an equidigital number, since it uses as much as digits as its factorization.
5500553448661 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8640000, while the sum is 52.
The spelling of 5500553448661 in words is "five trillion, five hundred billion, five hundred fifty-three million, four hundred forty-eight thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •