Base | Representation |
---|---|
bin | 1010111001110110… |
… | …0101001011101101 |
3 | 21112222122111112022 |
4 | 2232131211023231 |
5 | 21443302140221 |
6 | 1202235315525 |
7 | 132351001502 |
oct | 25635451355 |
9 | 7488574468 |
10 | 2926990061 |
11 | 1272233a56 |
12 | 6982abba5 |
13 | 3785309a8 |
14 | 1daa3d4a9 |
15 | 121e714ab |
hex | ae7652ed |
2926990061 has 2 divisors, whose sum is σ = 2926990062. Its totient is φ = 2926990060.
The previous prime is 2926990049. The next prime is 2926990063. The reversal of 2926990061 is 1600996292.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2904132100 + 22857961 = 53890^2 + 4781^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2926990061 is a prime.
Together with 2926990063, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 2926989994 and 2926990021.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2926990063) 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, 1463495030 + 1463495031.
It is an arithmetic number, because the mean of its divisors is an integer number (1463495031).
Almost surely, 22926990061 is an apocalyptic number.
It is an amenable number.
2926990061 is a deficient number, since it is larger than the sum of its proper divisors (1).
2926990061 is an equidigital number, since it uses as much as digits as its factorization.
2926990061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 104976, while the sum is 44.
The square root of 2926990061 is about 54101.6641241284. The cubic root of 2926990061 is about 1430.4535150141.
The spelling of 2926990061 in words is "two billion, nine hundred twenty-six million, nine hundred ninety thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •