Base | Representation |
---|---|
bin | 111110000000100… |
… | …0000000111111101 |
3 | 12101000002022222211 |
4 | 1330001000013331 |
5 | 13230120344222 |
6 | 542243140421 |
7 | 102363061234 |
oct | 17401000775 |
9 | 5330068884 |
10 | 2080637437 |
11 | 97851377a |
12 | 4a0974711 |
13 | 27209b918 |
14 | 15a489b1b |
15 | c29e0277 |
hex | 7c0401fd |
2080637437 has 8 divisors (see below), whose sum is σ = 2092298040. Its totient is φ = 2068999680.
The previous prime is 2080637411. The next prime is 2080637441. The reversal of 2080637437 is 7347360802.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 364275396 + 1716362041 = 19086^2 + 41429^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2080637437 - 27 = 2080637309 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2080637437.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2080631437) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 196593 + ... + 206905.
It is an arithmetic number, because the mean of its divisors is an integer number (261537255).
Almost surely, 22080637437 is an apocalyptic number.
It is an amenable number.
2080637437 is a deficient number, since it is larger than the sum of its proper divisors (11660603).
2080637437 is a wasteful number, since it uses less digits than its factorization.
2080637437 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11423.
The product of its (nonzero) digits is 169344, while the sum is 40.
The square root of 2080637437 is about 45614.0048340419. The cubic root of 2080637437 is about 1276.6312453123.
The spelling of 2080637437 in words is "two billion, eighty million, six hundred thirty-seven thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •