Base | Representation |
---|---|
bin | 1010011011111110… |
… | …0110100001110101 |
3 | 21020020212122011202 |
4 | 2212333212201311 |
5 | 21214213100431 |
6 | 1142001542245 |
7 | 126266656403 |
oct | 24677464165 |
9 | 7206778152 |
10 | 2801690741 |
11 | 12085327a3 |
12 | 662344985 |
13 | 35859c995 |
14 | 1c8144473 |
15 | 115e708cb |
hex | a6fe6875 |
2801690741 has 2 divisors, whose sum is σ = 2801690742. Its totient is φ = 2801690740.
The previous prime is 2801690687. The next prime is 2801690767. The reversal of 2801690741 is 1470961082.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2453121841 + 348568900 = 49529^2 + 18670^2 .
It is a cyclic number.
It is not a de Polignac number, because 2801690741 - 26 = 2801690677 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2801690695 and 2801690704.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2801690041) 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, 1400845370 + 1400845371.
It is an arithmetic number, because the mean of its divisors is an integer number (1400845371).
Almost surely, 22801690741 is an apocalyptic number.
It is an amenable number.
2801690741 is a deficient number, since it is larger than the sum of its proper divisors (1).
2801690741 is an equidigital number, since it uses as much as digits as its factorization.
2801690741 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24192, while the sum is 38.
The square root of 2801690741 is about 52930.9998110748. Note that the first 3 decimals coincide. The cubic root of 2801690741 is about 1409.7433835426.
The spelling of 2801690741 in words is "two billion, eight hundred one million, six hundred ninety thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •