Base | Representation |
---|---|
bin | 101001001101001101100… |
… | …0000010110101100010101 |
3 | 202001102010211000112222220 |
4 | 1102122123000112230111 |
5 | 1220242034032120212 |
6 | 20013414243212553 |
7 | 1123110345054315 |
oct | 122323300265425 |
9 | 22042124015886 |
10 | 5663367457557 |
11 | 1893903316897 |
12 | 775722377159 |
13 | 32109001c494 |
14 | 158173819445 |
15 | 9c4b576c38c |
hex | 5269b016b15 |
5663367457557 has 8 divisors (see below), whose sum is σ = 7551194916480. Its totient is φ = 3775559151840.
The previous prime is 5663367457441. The next prime is 5663367457589. The reversal of 5663367457557 is 7557547633665.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5663367457557 - 215 = 5663367424789 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5663367457491 and 5663367457500.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5663367457357) 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 in 7 ways as a sum of consecutive naturals, for example, 4083544 + ... + 5291697.
It is an arithmetic number, because the mean of its divisors is an integer number (943899364560).
Almost surely, 25663367457557 is an apocalyptic number.
It is an amenable number.
5663367457557 is a deficient number, since it is larger than the sum of its proper divisors (1887827458923).
5663367457557 is a wasteful number, since it uses less digits than its factorization.
5663367457557 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9576603.
The product of its digits is 1666980000, while the sum is 69.
The spelling of 5663367457557 in words is "five trillion, six hundred sixty-three billion, three hundred sixty-seven million, four hundred fifty-seven thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •