Base | Representation |
---|---|
bin | 1000000010000100… |
… | …1101010111100000 |
3 | 12120021020202110111 |
4 | 2000201031113200 |
5 | 13403441023102 |
6 | 553542341104 |
7 | 104301206515 |
oct | 20041152740 |
9 | 5507222414 |
10 | 2156189152 |
11 | a07126907 |
12 | 50212a794 |
13 | 284932390 |
14 | 16651530c |
15 | c9465cd7 |
hex | 8084d5e0 |
2156189152 has 96 divisors (see below), whose sum is σ = 4858056000. Its totient is φ = 933224448.
The previous prime is 2156189111. The next prime is 2156189153. The reversal of 2156189152 is 2519816512.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2156189153) 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, 3599349 + ... + 3599947.
It is an arithmetic number, because the mean of its divisors is an integer number (50604750).
Almost surely, 22156189152 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 2156189152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2429028000).
2156189152 is an abundant number, since it is smaller than the sum of its proper divisors (2701866848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2156189152 is a wasteful number, since it uses less digits than its factorization.
2156189152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1148 (or 1140 counting only the distinct ones).
The product of its digits is 43200, while the sum is 40.
The square root of 2156189152 is about 46434.7838586549. The cubic root of 2156189152 is about 1291.9001606627.
The spelling of 2156189152 in words is "two billion, one hundred fifty-six million, one hundred eighty-nine thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •