Base | Representation |
---|---|
bin | 100110010100001011010… |
… | …010011101010101111001 |
3 | 100022201020121012010100112 |
4 | 212110023102131111321 |
5 | 321114343102344401 |
6 | 5333330244514105 |
7 | 361141205423315 |
oct | 46241322352571 |
9 | 10281217163315 |
10 | 2633004340601 |
11 | 925718342a28 |
12 | 3663639ab935 |
13 | 1613a2b2aaab |
14 | 9161c194b45 |
15 | 487555c43bb |
hex | 2650b49d579 |
2633004340601 has 2 divisors, whose sum is σ = 2633004340602. Its totient is φ = 2633004340600.
The previous prime is 2633004340543. The next prime is 2633004340613. The reversal of 2633004340601 is 1060434003362.
2633004340601 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2592908283001 + 40096057600 = 1610251^2 + 200240^2 .
It is a cyclic number.
It is not a de Polignac number, because 2633004340601 - 210 = 2633004339577 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (2633004340201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1316502170300 + 1316502170301.
It is an arithmetic number, because the mean of its divisors is an integer number (1316502170301).
Almost surely, 22633004340601 is an apocalyptic number.
It is an amenable number.
2633004340601 is a deficient number, since it is larger than the sum of its proper divisors (1).
2633004340601 is an equidigital number, since it uses as much as digits as its factorization.
2633004340601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31104, while the sum is 32.
Adding to 2633004340601 its reverse (1060434003362), we get a palindrome (3693438343963).
The spelling of 2633004340601 in words is "two trillion, six hundred thirty-three billion, four million, three hundred forty thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •