Base | Representation |
---|---|
bin | 11100101111111101010110… |
… | …10110010011010010110101 |
3 | 22021211211011020021001221102 |
4 | 32113332223112103102311 |
5 | 31241301040041124312 |
6 | 342243032423255445 |
7 | 16213346612462312 |
oct | 1627765326232265 |
9 | 267754136231842 |
10 | 63220498379957 |
11 | 191647321a9266 |
12 | 7110680baa585 |
13 | 293788a410a69 |
14 | 1187c61c89d09 |
15 | 74979c12eec2 |
hex | 397fab5934b5 |
63220498379957 has 2 divisors, whose sum is σ = 63220498379958. Its totient is φ = 63220498379956.
The previous prime is 63220498379923. The next prime is 63220498380031. The reversal of 63220498379957 is 75997389402236.
It is an a-pointer prime, because the next prime (63220498380031) can be obtained adding 63220498379957 to its sum of digits (74).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 56126377996516 + 7094120383441 = 7491754^2 + 2663479^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-63220498379957 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (63220498379917) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 31610249189978 + 31610249189979.
It is an arithmetic number, because the mean of its divisors is an integer number (31610249189979).
Almost surely, 263220498379957 is an apocalyptic number.
It is an amenable number.
63220498379957 is a deficient number, since it is larger than the sum of its proper divisors (1).
63220498379957 is an equidigital number, since it uses as much as digits as its factorization.
63220498379957 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1234517760, while the sum is 74.
The spelling of 63220498379957 in words is "sixty-three trillion, two hundred twenty billion, four hundred ninety-eight million, three hundred seventy-nine thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •