Base | Representation |
---|---|
bin | 11100101111010010100111… |
… | …01101001001010010000011 |
3 | 22021202121221010201221120201 |
4 | 32113221103231021102003 |
5 | 31240412042100334041 |
6 | 342224315523150031 |
7 | 16211605165231504 |
oct | 1627512355112203 |
9 | 267677833657521 |
10 | 63197553136771 |
11 | 19155a28209469 |
12 | 7108138815317 |
13 | 29356717b41a1 |
14 | 1186ac6772bab |
15 | 748da7a39631 |
hex | 397a53b49483 |
63197553136771 has 2 divisors, whose sum is σ = 63197553136772. Its totient is φ = 63197553136770.
The previous prime is 63197553136621. The next prime is 63197553136793. The reversal of 63197553136771 is 17763135579136.
63197553136771 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 63197553136771 - 29 = 63197553136259 is a prime.
It is a super-2 number, since 2×631975531367712 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (63197553136171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 31598776568385 + 31598776568386.
It is an arithmetic number, because the mean of its divisors is an integer number (31598776568386).
Almost surely, 263197553136771 is an apocalyptic number.
63197553136771 is a deficient number, since it is larger than the sum of its proper divisors (1).
63197553136771 is an equidigital number, since it uses as much as digits as its factorization.
63197553136771 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 75014100, while the sum is 64.
The spelling of 63197553136771 in words is "sixty-three trillion, one hundred ninety-seven billion, five hundred fifty-three million, one hundred thirty-six thousand, seven hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •