Base | Representation |
---|---|
bin | 11100111011000110111111… |
… | …10010011100010010000101 |
3 | 22100012110002100111020022210 |
4 | 32131203133302130102011 |
5 | 31314040213321331011 |
6 | 343135034313214033 |
7 | 16253132151650130 |
oct | 1635433762342205 |
9 | 270173070436283 |
10 | 63603630261381 |
11 | 192a216a1594a1 |
12 | 7172987101319 |
13 | 2964a48182942 |
14 | 119c609a9d217 |
15 | 754722c026a6 |
hex | 39d8dfc9c485 |
63603630261381 has 16 divisors (see below), whose sum is σ = 97002584288768. Its totient is φ = 36313894047600.
The previous prime is 63603630261377. The next prime is 63603630261401. The reversal of 63603630261381 is 18316203630636.
It is not a de Polignac number, because 63603630261381 - 22 = 63603630261377 is a prime.
It is a super-2 number, since 2×636036302613812 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 63603630261381.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (63603630260381) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1293205255 + ... + 1293254436.
It is an arithmetic number, because the mean of its divisors is an integer number (6062661518048).
Almost surely, 263603630261381 is an apocalyptic number.
It is an amenable number.
63603630261381 is a deficient number, since it is larger than the sum of its proper divisors (33398954027387).
63603630261381 is a wasteful number, since it uses less digits than its factorization.
63603630261381 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2586460872.
The product of its (nonzero) digits is 1679616, while the sum is 48.
The spelling of 63603630261381 in words is "sixty-three trillion, six hundred three billion, six hundred thirty million, two hundred sixty-one thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •