Base | Representation |
---|---|
bin | 11100110010001000100010… |
… | …00110111011101101001011 |
3 | 22022002222000201022021121001 |
4 | 32121010101012323231023 |
5 | 31244012102314234433 |
6 | 342341231144355431 |
7 | 16221633362411626 |
oct | 1631042106735513 |
9 | 268088021267531 |
10 | 63295220071243 |
11 | 19193396699936 |
12 | 7123055175b77 |
13 | 2941937b42384 |
14 | 118b70d9d8dbd |
15 | 74b6c202057d |
hex | 3991111bbb4b |
63295220071243 has 2 divisors, whose sum is σ = 63295220071244. Its totient is φ = 63295220071242.
The previous prime is 63295220071229. The next prime is 63295220071283. The reversal of 63295220071243 is 34217002259236.
63295220071243 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-63295220071243 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 63295220071193 and 63295220071202.
It is not a weakly prime, because it can be changed into another prime (63295220071283) 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, 31647610035621 + 31647610035622.
It is an arithmetic number, because the mean of its divisors is an integer number (31647610035622).
Almost surely, 263295220071243 is an apocalyptic number.
63295220071243 is a deficient number, since it is larger than the sum of its proper divisors (1).
63295220071243 is an equidigital number, since it uses as much as digits as its factorization.
63295220071243 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1088640, while the sum is 46.
The spelling of 63295220071243 in words is "sixty-three trillion, two hundred ninety-five billion, two hundred twenty million, seventy-one thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •