Base | Representation |
---|---|
bin | 1000000000000010111111011… |
… | …0101011100001100000110000 |
3 | 2201211102101212011102010002221 |
4 | 2000000233312223201200300 |
5 | 1042243203214141304120 |
6 | 5313223124333050424 |
7 | 226405334652012340 |
oct | 20000576653414060 |
9 | 2654371764363087 |
10 | 563001336666160 |
11 | 153431587151727 |
12 | 53189520626a14 |
13 | 1b21ba4b9772a2 |
14 | 9d055a53d2d20 |
15 | 4514e542290aa |
hex | 2000bf6ae1830 |
563001336666160 has 80 divisors (see below), whose sum is σ = 1495981059566400. Its totient is φ = 193028245291008.
The previous prime is 563001336666127. The next prime is 563001336666229. The reversal of 563001336666160 is 61666633100365.
It is a tau number, because it is divible by the number of its divisors (80).
It is a junction number, because it is equal to n+sod(n) for n = 563001336666098 and 563001336666107.
It is an unprimeable number.
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, 145373776 + ... + 149196304.
It is an arithmetic number, because the mean of its divisors is an integer number (18699763244580).
Almost surely, 2563001336666160 is an apocalyptic number.
It is an amenable number.
563001336666160 is an abundant number, since it is smaller than the sum of its proper divisors (932979722900240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
563001336666160 is a wasteful number, since it uses less digits than its factorization.
563001336666160 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4085558 (or 4085552 counting only the distinct ones).
The product of its (nonzero) digits is 6298560, while the sum is 52.
The spelling of 563001336666160 in words is "five hundred sixty-three trillion, one billion, three hundred thirty-six million, six hundred sixty-six thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •