Base | Representation |
---|---|
bin | 1111000101111… |
… | …1110100110101 |
3 | 11102010022221222 |
4 | 3301133310311 |
5 | 112201311221 |
6 | 10140520125 |
7 | 1366046456 |
oct | 361376465 |
9 | 142108858 |
10 | 63307061 |
11 | 3280a594 |
12 | 19250045 |
13 | 101672cc |
14 | 859d12d |
15 | 58579ab |
hex | 3c5fd35 |
63307061 has 2 divisors, whose sum is σ = 63307062. Its totient is φ = 63307060.
The previous prime is 63307043. The next prime is 63307093. The reversal of 63307061 is 16070336.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 41860900 + 21446161 = 6470^2 + 4631^2 .
It is a cyclic number.
It is not a de Polignac number, because 63307061 - 210 = 63306037 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 63307061.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (63307001) 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, 31653530 + 31653531.
It is an arithmetic number, because the mean of its divisors is an integer number (31653531).
Almost surely, 263307061 is an apocalyptic number.
It is an amenable number.
63307061 is a deficient number, since it is larger than the sum of its proper divisors (1).
63307061 is an equidigital number, since it uses as much as digits as its factorization.
63307061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2268, while the sum is 26.
The square root of 63307061 is about 7956.5734458999. The cubic root of 63307061 is about 398.5511353981.
Adding to 63307061 its reverse (16070336), we get a palindrome (79377397).
The spelling of 63307061 in words is "sixty-three million, three hundred seven thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •