Base | Representation |
---|---|
bin | 1001110011001000… |
… | …0001111111100101 |
3 | 20210022111012001001 |
4 | 2130302001333211 |
5 | 20341333023221 |
6 | 1113001433301 |
7 | 122116462066 |
oct | 23462017745 |
9 | 6708435031 |
10 | 2630361061 |
11 | 112a852219 |
12 | 614a9b831 |
13 | 32bc43383 |
14 | 1ad4a656d |
15 | 105dcb391 |
hex | 9cc81fe5 |
2630361061 has 2 divisors, whose sum is σ = 2630361062. Its totient is φ = 2630361060.
The previous prime is 2630361059. The next prime is 2630361101. The reversal of 2630361061 is 1601630362.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1979805025 + 650556036 = 44495^2 + 25506^2 .
It is a cyclic number.
It is not a de Polignac number, because 2630361061 - 21 = 2630361059 is a prime.
It is a super-2 number, since 2×26303610612 = 13837598622450091442, which contains 22 as substring.
Together with 2630361059, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2630361661) 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, 1315180530 + 1315180531.
It is an arithmetic number, because the mean of its divisors is an integer number (1315180531).
Almost surely, 22630361061 is an apocalyptic number.
It is an amenable number.
2630361061 is a deficient number, since it is larger than the sum of its proper divisors (1).
2630361061 is an equidigital number, since it uses as much as digits as its factorization.
2630361061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 28.
The square root of 2630361061 is about 51287.0457425654. The cubic root of 2630361061 is about 1380.4005455310.
The spelling of 2630361061 in words is "two billion, six hundred thirty million, three hundred sixty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •