Base | Representation |
---|---|
bin | 111010111011000101… |
… | …100110011100010001 |
3 | 20001022021120011200121 |
4 | 322323011212130101 |
5 | 2014033144142323 |
6 | 45022020150241 |
7 | 4366564046032 |
oct | 727305463421 |
9 | 201267504617 |
10 | 63268349713 |
11 | 24917374628 |
12 | 10318538381 |
13 | 5c7390a32a |
14 | 30c2990a89 |
15 | 19a4652a5d |
hex | ebb166711 |
63268349713 has 2 divisors, whose sum is σ = 63268349714. Its totient is φ = 63268349712.
The previous prime is 63268349681. The next prime is 63268349737. The reversal of 63268349713 is 31794386236.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 38875220224 + 24393129489 = 197168^2 + 156183^2 .
It is a cyclic number.
It is not a de Polignac number, because 63268349713 - 25 = 63268349681 is a prime.
It is not a weakly prime, because it can be changed into another prime (63268349783) 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, 31634174856 + 31634174857.
It is an arithmetic number, because the mean of its divisors is an integer number (31634174857).
Almost surely, 263268349713 is an apocalyptic number.
It is an amenable number.
63268349713 is a deficient number, since it is larger than the sum of its proper divisors (1).
63268349713 is an equidigital number, since it uses as much as digits as its factorization.
63268349713 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3919104, while the sum is 52.
The spelling of 63268349713 in words is "sixty-three billion, two hundred sixty-eight million, three hundred forty-nine thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •