Base | Representation |
---|---|
bin | 1000001011010000… |
… | …0001010111010000 |
3 | 12122221200001022220 |
4 | 2002310001113100 |
5 | 13443314101102 |
6 | 1001435301040 |
7 | 105246300555 |
oct | 20264012720 |
9 | 5587601286 |
10 | 2194675152 |
11 | a26922a1a |
12 | 512baa780 |
13 | 28c8b8a67 |
14 | 16b692a2c |
15 | cca191bc |
hex | 82d015d0 |
2194675152 has 80 divisors (see below), whose sum is σ = 5842126080. Its totient is φ = 709574656.
The previous prime is 2194675121. The next prime is 2194675159. The reversal of 2194675152 is 2515764912.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2194675159) 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 15 ways as a sum of consecutive naturals, for example, 250624 + ... + 259232.
It is an arithmetic number, because the mean of its divisors is an integer number (73026576).
Almost surely, 22194675152 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 2194675152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2921063040).
2194675152 is an abundant number, since it is smaller than the sum of its proper divisors (3647450928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2194675152 is a wasteful number, since it uses less digits than its factorization.
2194675152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8780 (or 8774 counting only the distinct ones).
The product of its digits is 151200, while the sum is 42.
The square root of 2194675152 is about 46847.3601390729. The cubic root of 2194675152 is about 1299.5412882588.
The spelling of 2194675152 in words is "two billion, one hundred ninety-four million, six hundred seventy-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •