Base | Representation |
---|---|
bin | 1010011101001111… |
… | …0100010101111000 |
3 | 21020121211212200000 |
4 | 2213103310111320 |
5 | 21222042141300 |
6 | 1142311313000 |
7 | 126363010620 |
oct | 24723642570 |
9 | 7217755600 |
10 | 2806990200 |
11 | 1210522313 |
12 | 66407b760 |
13 | 359706b61 |
14 | 1c8b23880 |
15 | 11666ac00 |
hex | a74f4578 |
2806990200 has 576 divisors, whose sum is σ = 11525928960. Its totient is φ = 621457920.
The previous prime is 2806990169. The next prime is 2806990211. The reversal of 2806990200 is 20996082.
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 pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 12587289 + ... + 12587511.
Almost surely, 22806990200 is an apocalyptic number.
2806990200 is a gapful number since it is divisible by the number (20) 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 2806990200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5762964480).
2806990200 is an abundant number, since it is smaller than the sum of its proper divisors (8718938760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2806990200 is a wasteful number, since it uses less digits than its factorization.
2806990200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 298 (or 277 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 36.
The square root of 2806990200 is about 52981.0362299568. The cubic root of 2806990200 is about 1410.6316771306.
The spelling of 2806990200 in words is "two billion, eight hundred six million, nine hundred ninety thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •