Base | Representation |
---|---|
bin | 1000001011110001… |
… | …1011001011011000 |
3 | 12200002210222010100 |
4 | 2002330123023120 |
5 | 13444400044130 |
6 | 1001554415400 |
7 | 105304104150 |
oct | 20274331330 |
9 | 5602728110 |
10 | 2196878040 |
11 | a28097a95 |
12 | 513891560 |
13 | 2901aa646 |
14 | 16baa7760 |
15 | ccd01c60 |
hex | 82f1b2d8 |
2196878040 has 384 divisors, whose sum is σ = 9097920000. Its totient is φ = 447565824.
The previous prime is 2196878029. The next prime is 2196878053. The reversal of 2196878040 is 408786912.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 812611 + ... + 815309.
It is an arithmetic number, because the mean of its divisors is an integer number (23692500).
Almost surely, 22196878040 is an apocalyptic number.
2196878040 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 2196878040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4548960000).
2196878040 is an abundant number, since it is smaller than the sum of its proper divisors (6901041960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2196878040 is a wasteful number, since it uses less digits than its factorization.
2196878040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2759 (or 2752 counting only the distinct ones).
The product of its (nonzero) digits is 193536, while the sum is 45.
The square root of 2196878040 is about 46870.8655776699. The cubic root of 2196878040 is about 1299.9759443280.
The spelling of 2196878040 in words is "two billion, one hundred ninety-six million, eight hundred seventy-eight thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •