Base | Representation |
---|---|
bin | 111100110010100… |
… | …1010110110010000 |
3 | 12021011012220120211 |
4 | 1321211022312100 |
5 | 13134141140041 |
6 | 534223413504 |
7 | 101355621400 |
oct | 17145126620 |
9 | 5234186524 |
10 | 2039786896 |
11 | 9574520a4 |
12 | 48b154294 |
13 | 266797bc4 |
14 | 154c94800 |
15 | be121481 |
hex | 7994ad90 |
2039786896 has 45 divisors (see below), whose sum is σ = 4600177761. Its totient is φ = 873652416.
The previous prime is 2039786893. The next prime is 2039786897. The reversal of 2039786896 is 6986879302.
The square root of 2039786896 is 45164.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 1274490000 + 765296896 = 35700^2 + 27664^2 .
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 2039786896.
It is not an unprimeable number, because it can be changed into a prime (2039786893) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 1263786 + ... + 1265398.
Almost surely, 22039786896 is an apocalyptic number.
2039786896 is the 45164-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2039786896
2039786896 is an abundant number, since it is smaller than the sum of its proper divisors (2560390865).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2039786896 is an frugal number, since it uses more digits than its factorization.
2039786896 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3248 (or 1622 counting only the distinct ones).
The product of its (nonzero) digits is 7838208, while the sum is 58.
The cubic root of 2039786896 is about 1268.2209773864.
The spelling of 2039786896 in words is "two billion, thirty-nine million, seven hundred eighty-six thousand, eight hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •