Base | Representation |
---|---|
bin | 1000001011101011… |
… | …0111110101101110 |
3 | 12200002001021222100 |
4 | 2002322313311232 |
5 | 13444244034100 |
6 | 1001541555530 |
7 | 105300460656 |
oct | 20272676556 |
9 | 5602037870 |
10 | 2196471150 |
11 | a2793a315 |
12 | 513715ba6 |
13 | 290097393 |
14 | 16b9dd366 |
15 | ccc71400 |
hex | 82eb7d6e |
2196471150 has 72 divisors (see below), whose sum is σ = 5910123960. Its totient is φ = 584838720.
The previous prime is 2196471149. The next prime is 2196471161. The reversal of 2196471150 is 511746912.
2196471150 is a `hidden beast` number, since 2 + 1 + 9 + 647 + 1 + 1 + 5 + 0 = 666.
It is a congruent number.
It is an unprimeable number.
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 35 ways as a sum of consecutive naturals, for example, 326521 + ... + 333179.
It is an arithmetic number, because the mean of its divisors is an integer number (82085055).
Almost surely, 22196471150 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2196471150, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2955061980).
2196471150 is an abundant number, since it is smaller than the sum of its proper divisors (3713652810).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2196471150 is a wasteful number, since it uses less digits than its factorization.
2196471150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7410 (or 7402 counting only the distinct ones).
The product of its (nonzero) digits is 15120, while the sum is 36.
The square root of 2196471150 is about 46866.5248338300. The cubic root of 2196471150 is about 1299.8956819646.
The spelling of 2196471150 in words is "two billion, one hundred ninety-six million, four hundred seventy-one thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •