Base | Representation |
---|---|
bin | 111110000110111… |
… | …1011111000000000 |
3 | 12101020110120211200 |
4 | 1330031323320000 |
5 | 13232002343104 |
6 | 542443541200 |
7 | 102433642050 |
oct | 17415737000 |
9 | 5336416750 |
10 | 2084027904 |
11 | 97a41a012 |
12 | 4a1b2a800 |
13 | 2729b7c0a |
14 | 15aacd560 |
15 | c2e5eb39 |
hex | 7c37be00 |
2084027904 has 120 divisors (see below), whose sum is σ = 6873987120. Its totient is φ = 595427328.
The previous prime is 2084027819. The next prime is 2084027921. The reversal of 2084027904 is 4097204802.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 49 + ... + 64560.
It is an arithmetic number, because the mean of its divisors is an integer number (57283226).
Almost surely, 22084027904 is an apocalyptic number.
2084027904 is a gapful number since it is divisible by the number (24) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2084027904, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3436993560).
2084027904 is an abundant number, since it is smaller than the sum of its proper divisors (4789959216).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2084027904 is an equidigital number, since it uses as much as digits as its factorization.
2084027904 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 64640 (or 64621 counting only the distinct ones).
The product of its (nonzero) digits is 32256, while the sum is 36.
The square root of 2084027904 is about 45651.1544651392. The cubic root of 2084027904 is about 1277.3243064996.
The spelling of 2084027904 in words is "two billion, eighty-four million, twenty-seven thousand, nine hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •