Base | Representation |
---|---|
bin | 1010000000000111… |
… | …1111101000000000 |
3 | 20221010001220021110 |
4 | 2200001333220000 |
5 | 20444312033222 |
6 | 1122230123320 |
7 | 123351036435 |
oct | 24001775000 |
9 | 6833056243 |
10 | 2684877312 |
11 | 11585a8077 |
12 | 62b1b0540 |
13 | 33a320300 |
14 | 1b6817b8c |
15 | 10aa9930c |
hex | a007fa00 |
2684877312 has 120 divisors (see below), whose sum is σ = 7745959584. Its totient is φ = 826036224.
The previous prime is 2684877281. The next prime is 2684877313. The reversal of 2684877312 is 2137784862.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is not an unprimeable number, because it can be changed into a prime (2684877313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 254413 + ... + 264755.
Almost surely, 22684877312 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 2684877312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3872979792).
2684877312 is an abundant number, since it is smaller than the sum of its proper divisors (5061082272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2684877312 is a wasteful number, since it uses less digits than its factorization.
2684877312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10390 (or 10361 counting only the distinct ones).
The product of its digits is 903168, while the sum is 48.
The square root of 2684877312 is about 51815.8017596949. The cubic root of 2684877312 is about 1389.8720293484.
The spelling of 2684877312 in words is "two billion, six hundred eighty-four million, eight hundred seventy-seven thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •