Base | Representation |
---|---|
bin | 11100111000111111000010… |
… | …11010010101100111010101 |
3 | 22022221110200202011212221020 |
4 | 32130133201122111213111 |
5 | 31311341224110144023 |
6 | 343041324032111353 |
7 | 16244636362632153 |
oct | 1634374132254725 |
9 | 268843622155836 |
10 | 63530643053013 |
11 | 19274215843584 |
12 | 71607b7995559 |
13 | 295abb5bb2196 |
14 | 1198c844503d3 |
15 | 7528a0227de3 |
hex | 39c7e16959d5 |
63530643053013 has 8 divisors (see below), whose sum is σ = 84730853064576. Its totient is φ = 42342097538400.
The previous prime is 63530643052949. The next prime is 63530643053021. The reversal of 63530643053013 is 31035034603536.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 63530643053013 - 26 = 63530643052949 is a prime.
It is a super-2 number, since 2×635306430530132 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (63530643053083) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2916111528 + ... + 2916133313.
It is an arithmetic number, because the mean of its divisors is an integer number (10591356633072).
Almost surely, 263530643053013 is an apocalyptic number.
It is an amenable number.
63530643053013 is a deficient number, since it is larger than the sum of its proper divisors (21200210011563).
63530643053013 is a wasteful number, since it uses less digits than its factorization.
63530643053013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5832248475.
The product of its (nonzero) digits is 874800, while the sum is 42.
Adding to 63530643053013 its reverse (31035034603536), we get a palindrome (94565677656549).
The spelling of 63530643053013 in words is "sixty-three trillion, five hundred thirty billion, six hundred forty-three million, fifty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •