Base | Representation |
---|---|
bin | 1000000000000111010010101… |
… | …1101111010101010001000000 |
3 | 2201211200110121201000120002210 |
4 | 2000001310223233111101000 |
5 | 1042300411043233113211 |
6 | 5313321110025542120 |
7 | 226413562251026241 |
oct | 20001645357252100 |
9 | 2654613551016083 |
10 | 563075241301056 |
11 | 15345a961411790 |
12 | 5319b907044940 |
13 | 1b2259c9033393 |
14 | 9d08db6816cc8 |
15 | 4516d2c5239a6 |
hex | 2001d2bbd5440 |
563075241301056 has 112 divisors (see below), whose sum is σ = 1625271507782208. Its totient is φ = 170625542707200.
The previous prime is 563075241301049. The next prime is 563075241301057. The reversal of 563075241301056 is 650103142570365.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a junction number, because it is equal to n+sod(n) for n = 563075241300996 and 563075241301014.
It is not an unprimeable number, because it can be changed into a prime (563075241301057) 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 15 ways as a sum of consecutive naturals, for example, 107132946 + ... + 112265838.
Almost surely, 2563075241301056 is an apocalyptic number.
It is an amenable number.
563075241301056 is an abundant number, since it is smaller than the sum of its proper divisors (1062196266481152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
563075241301056 is a wasteful number, since it uses less digits than its factorization.
563075241301056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5184860 (or 5184850 counting only the distinct ones).
The product of its (nonzero) digits is 2268000, while the sum is 48.
The spelling of 563075241301056 in words is "five hundred sixty-three trillion, seventy-five billion, two hundred forty-one million, three hundred one thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •