Base | Representation |
---|---|
bin | 1000000000010110101101011… |
… | …1010110101010101111101010 |
3 | 2201212121210022002211111111201 |
4 | 2000011223113112222233222 |
5 | 1042314231023030143032 |
6 | 5314042513032514414 |
7 | 226441660112533552 |
oct | 20005532726525752 |
9 | 2655553262744451 |
10 | 563340113521642 |
11 | 153552222922426 |
12 | 5322310824ba0a |
13 | 1b24498b31c4a2 |
14 | 9d17b424aa162 |
15 | 451db80d118e7 |
hex | 2005ad75aabea |
563340113521642 has 4 divisors (see below), whose sum is σ = 845010170282466. Its totient is φ = 281670056760820.
The previous prime is 563340113521631. The next prime is 563340113521649. The reversal of 563340113521642 is 246125311043365.
It is a happy number.
563340113521642 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 562921699892841 + 418413628801 = 23725971^2 + 646849^2 .
It is a junction number, because it is equal to n+sod(n) for n = 563340113521592 and 563340113521601.
It is not an unprimeable number, because it can be changed into a prime (563340113521649) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 140835028380409 + ... + 140835028380412.
Almost surely, 2563340113521642 is an apocalyptic number.
563340113521642 is a deficient number, since it is larger than the sum of its proper divisors (281670056760824).
563340113521642 is a wasteful number, since it uses less digits than its factorization.
563340113521642 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 281670056760823.
The product of its (nonzero) digits is 1555200, while the sum is 46.
The spelling of 563340113521642 in words is "five hundred sixty-three trillion, three hundred forty billion, one hundred thirteen million, five hundred twenty-one thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •