Base | Representation |
---|---|
bin | 111010110011110011… |
… | …011000001001010101 |
3 | 20000222202120212120121 |
4 | 322303303120021111 |
5 | 2013310402211203 |
6 | 45001532431541 |
7 | 4363551160234 |
oct | 726363301125 |
9 | 200882525517 |
10 | 63146132053 |
11 | 248643886a4 |
12 | 102a36185b1 |
13 | 5c544b7ba4 |
14 | 30b0658b1b |
15 | 1998a600bd |
hex | eb3cd8255 |
63146132053 has 2 divisors, whose sum is σ = 63146132054. Its totient is φ = 63146132052.
The previous prime is 63146132003. The next prime is 63146132087. The reversal of 63146132053 is 35023164136.
It is an a-pointer prime, because the next prime (63146132087) can be obtained adding 63146132053 to its sum of digits (34).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 40162965649 + 22983166404 = 200407^2 + 151602^2 .
It is a cyclic number.
It is not a de Polignac number, because 63146132053 - 225 = 63112577621 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (63146132003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 31573066026 + 31573066027.
It is an arithmetic number, because the mean of its divisors is an integer number (31573066027).
Almost surely, 263146132053 is an apocalyptic number.
It is an amenable number.
63146132053 is a deficient number, since it is larger than the sum of its proper divisors (1).
63146132053 is an equidigital number, since it uses as much as digits as its factorization.
63146132053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 38880, while the sum is 34.
Adding to 63146132053 its reverse (35023164136), we get a palindrome (98169296189).
The spelling of 63146132053 in words is "sixty-three billion, one hundred forty-six million, one hundred thirty-two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •