Base | Representation |
---|---|
bin | 111110100000111… |
… | …0101010001111001 |
3 | 12102012001202200001 |
4 | 1331001311101321 |
5 | 13243443214002 |
6 | 544051313001 |
7 | 102660403201 |
oct | 17501652171 |
9 | 5365052601 |
10 | 2097632377 |
11 | 987071285 |
12 | 4a65ab761 |
13 | 27576c2b9 |
14 | 15c831401 |
15 | c424aa87 |
hex | 7d075479 |
2097632377 has 4 divisors (see below), whose sum is σ = 2098757776. Its totient is φ = 2096506980.
The previous prime is 2097632353. The next prime is 2097632461. The reversal of 2097632377 is 7732367902.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2097632377 - 27 = 2097632249 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2097632347) 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 in 3 ways as a sum of consecutive naturals, for example, 559899 + ... + 563632.
It is an arithmetic number, because the mean of its divisors is an integer number (524689444).
Almost surely, 22097632377 is an apocalyptic number.
It is an amenable number.
2097632377 is a deficient number, since it is larger than the sum of its proper divisors (1125399).
2097632377 is a wasteful number, since it uses less digits than its factorization.
2097632377 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1125398.
The product of its (nonzero) digits is 666792, while the sum is 46.
The square root of 2097632377 is about 45799.9167794004. The cubic root of 2097632377 is about 1280.0977254895.
It can be divided in two parts, 20976323 and 77, that added together give a square (20976400 = 45802).
The spelling of 2097632377 in words is "two billion, ninety-seven million, six hundred thirty-two thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •