Base | Representation |
---|---|
bin | 1010101101001011… |
… | …1100001111111100 |
3 | 21102021200200120000 |
4 | 2223102330033330 |
5 | 21341202304213 |
6 | 1153100554300 |
7 | 131134325502 |
oct | 25322741774 |
9 | 7367620500 |
10 | 2873869308 |
11 | 1245251602 |
12 | 682552990 |
13 | 36a521cab |
14 | 1d3972672 |
15 | 11c47bc73 |
hex | ab4bc3fc |
2873869308 has 60 divisors (see below), whose sum is σ = 7525303632. Its totient is φ = 956370240.
The previous prime is 2873869307. The next prime is 2873869321. The reversal of 2873869308 is 8039683782.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2873869307) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 197416 + ... + 211472.
Almost surely, 22873869308 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2873869308, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3762651816).
2873869308 is an abundant number, since it is smaller than the sum of its proper divisors (4651434324).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2873869308 is a wasteful number, since it uses less digits than its factorization.
2873869308 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14704 (or 14693 counting only the distinct ones).
The product of its (nonzero) digits is 3483648, while the sum is 54.
The square root of 2873869308 is about 53608.4816796745. The cubic root of 2873869308 is about 1421.7470575040.
The spelling of 2873869308 in words is "two billion, eight hundred seventy-three million, eight hundred sixty-nine thousand, three hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •