Base | Representation |
---|---|
bin | 111011010100010000… |
… | …111111010000010001 |
3 | 20002101201102002222102 |
4 | 323110100333100101 |
5 | 2020414313442304 |
6 | 45131550050145 |
7 | 4413213400322 |
oct | 732420772021 |
9 | 202351362872 |
10 | 63690765329 |
11 | 2501385a744 |
12 | 10415aa9955 |
13 | 60102996b9 |
14 | 3122b0c449 |
15 | 19cb792d1e |
hex | ed443f411 |
63690765329 has 2 divisors, whose sum is σ = 63690765330. Its totient is φ = 63690765328.
The previous prime is 63690765311. The next prime is 63690765331. The reversal of 63690765329 is 92356709636.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 46483360000 + 17207405329 = 215600^2 + 131177^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-63690765329 is a prime.
It is a super-3 number, since 3×636907653293 (a number of 33 digits) contains 333 as substring.
It is a Sophie Germain prime.
Together with 63690765331, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (63690765379) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 31845382664 + 31845382665.
It is an arithmetic number, because the mean of its divisors is an integer number (31845382665).
Almost surely, 263690765329 is an apocalyptic number.
It is an amenable number.
63690765329 is a deficient number, since it is larger than the sum of its proper divisors (1).
63690765329 is an equidigital number, since it uses as much as digits as its factorization.
63690765329 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11022480, while the sum is 56.
The spelling of 63690765329 in words is "sixty-three billion, six hundred ninety million, seven hundred sixty-five thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •