Base | Representation |
---|---|
bin | 111110010011011… |
… | …0110000010101101 |
3 | 12101200202022220202 |
4 | 1330212312002231 |
5 | 13240140320423 |
6 | 543235523245 |
7 | 102543306104 |
oct | 17446660255 |
9 | 5350668822 |
10 | 2090557613 |
11 | 983079971 |
12 | 4a4159525 |
13 | 274163051 |
14 | 15b90d03b |
15 | c37ee728 |
hex | 7c9b60ad |
2090557613 has 2 divisors, whose sum is σ = 2090557614. Its totient is φ = 2090557612.
The previous prime is 2090557577. The next prime is 2090557621. The reversal of 2090557613 is 3167550902.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1885122724 + 205434889 = 43418^2 + 14333^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2090557613 is a prime.
It is a super-2 number, since 2×20905576132 = 8740862266544515538, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2090557663) 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, 1045278806 + 1045278807.
It is an arithmetic number, because the mean of its divisors is an integer number (1045278807).
Almost surely, 22090557613 is an apocalyptic number.
It is an amenable number.
2090557613 is a deficient number, since it is larger than the sum of its proper divisors (1).
2090557613 is an equidigital number, since it uses as much as digits as its factorization.
2090557613 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56700, while the sum is 38.
The square root of 2090557613 is about 45722.6159903390. The cubic root of 2090557613 is about 1278.6569598381.
The spelling of 2090557613 in words is "two billion, ninety million, five hundred fifty-seven thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •