Base | Representation |
---|---|
bin | 11100101011011011100001… |
… | …01010111010010110001101 |
3 | 22021021221111222020200000102 |
4 | 32111231300222322112031 |
5 | 31231223401121320042 |
6 | 342043340213140445 |
7 | 16166200614452564 |
oct | 1625556052722615 |
9 | 267257458220012 |
10 | 63064895104397 |
11 | 1910474320826a |
12 | 70a649592a725 |
13 | 2925cc002b244 |
14 | 118050027abdb |
15 | 7456e1680b32 |
hex | 395b70aba58d |
63064895104397 has 4 divisors (see below), whose sum is σ = 63064920678396. Its totient is φ = 63064869530400.
The previous prime is 63064895104301. The next prime is 63064895104423. The reversal of 63064895104397 is 79340159846036.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 30047620628041 + 33017274476356 = 5481571^2 + 5746066^2 .
It is a cyclic number.
It is not a de Polignac number, because 63064895104397 - 216 = 63064895038861 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (63064895104297) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8639648 + ... + 14169449.
It is an arithmetic number, because the mean of its divisors is an integer number (15766230169599).
Almost surely, 263064895104397 is an apocalyptic number.
It is an amenable number.
63064895104397 is a deficient number, since it is larger than the sum of its proper divisors (25573999).
63064895104397 is a wasteful number, since it uses less digits than its factorization.
63064895104397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25573998.
The product of its (nonzero) digits is 117573120, while the sum is 65.
The spelling of 63064895104397 in words is "sixty-three trillion, sixty-four billion, eight hundred ninety-five million, one hundred four thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •