Base | Representation |
---|---|
bin | 111010101110011011… |
… | …111111011010100001 |
3 | 20000202111012112220001 |
4 | 322232123333122201 |
5 | 2013114331142421 |
6 | 44544555220001 |
7 | 4361406065011 |
oct | 725633773241 |
9 | 200674175801 |
10 | 63056115361 |
11 | 24818595838 |
12 | 10279447601 |
13 | 5c3b95b485 |
14 | 30a2705c41 |
15 | 1990bcd691 |
hex | eae6ff6a1 |
63056115361 has 2 divisors, whose sum is σ = 63056115362. Its totient is φ = 63056115360.
The previous prime is 63056115277. The next prime is 63056115377. The reversal of 63056115361 is 16351165036.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 55714881600 + 7341233761 = 236040^2 + 85681^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-63056115361 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 63056115361.
It is not a weakly prime, because it can be changed into another prime (63056110361) 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, 31528057680 + 31528057681.
It is an arithmetic number, because the mean of its divisors is an integer number (31528057681).
Almost surely, 263056115361 is an apocalyptic number.
It is an amenable number.
63056115361 is a deficient number, since it is larger than the sum of its proper divisors (1).
63056115361 is an equidigital number, since it uses as much as digits as its factorization.
63056115361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48600, while the sum is 37.
The spelling of 63056115361 in words is "sixty-three billion, fifty-six million, one hundred fifteen thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •