Base | Representation |
---|---|
bin | 101000011011010000111… |
… | …0000111010001001000001 |
3 | 201200011021121220210222011 |
4 | 1100312201300322021001 |
5 | 1212012401301312221 |
6 | 15452235024212521 |
7 | 1112262334302043 |
oct | 120664160721101 |
9 | 21604247823864 |
10 | 5556106666561 |
11 | 1852371402a80 |
12 | 758988a6a141 |
13 | 313c28186809 |
14 | 152cba353a93 |
15 | 997d8da21e1 |
hex | 50da1c3a241 |
5556106666561 has 8 divisors (see below), whose sum is σ = 6062629808448. Its totient is φ = 5049820614000.
The previous prime is 5556106666543. The next prime is 5556106666567. The reversal of 5556106666561 is 1656666016555.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5556106666561 - 217 = 5556106535489 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5556106666496 and 5556106666505.
It is not an unprimeable number, because it can be changed into a prime (5556106666567) 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 in 7 ways as a sum of consecutive naturals, for example, 59223325 + ... + 59317066.
It is an arithmetic number, because the mean of its divisors is an integer number (757828726056).
Almost surely, 25556106666561 is an apocalyptic number.
It is an amenable number.
5556106666561 is a deficient number, since it is larger than the sum of its proper divisors (506523141887).
5556106666561 is a wasteful number, since it uses less digits than its factorization.
5556106666561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118544663.
The product of its (nonzero) digits is 29160000, while the sum is 58.
The spelling of 5556106666561 in words is "five trillion, five hundred fifty-six billion, one hundred six million, six hundred sixty-six thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •