Base | Representation |
---|---|
bin | 1111011110111010… |
… | …1000010011111000 |
3 | 101201122121122012110 |
4 | 3313232220103320 |
5 | 32002441233323 |
6 | 1524225412320 |
7 | 204665040522 |
oct | 36756502370 |
9 | 11648548173 |
10 | 4156196088 |
11 | 1843078700 |
12 | 97ba9a0a0 |
13 | 5130ac935 |
14 | 2b5db2a12 |
15 | 194d2a793 |
hex | f7ba84f8 |
4156196088 has 192 divisors, whose sum is σ = 11993748480. Its totient is φ = 1197884160.
The previous prime is 4156196087. The next prime is 4156196119. The reversal of 4156196088 is 8806916514.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4156196081) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 5049645 + ... + 5050467.
It is an arithmetic number, because the mean of its divisors is an integer number (62467440).
Almost surely, 24156196088 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 4156196088, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5996874240).
4156196088 is an abundant number, since it is smaller than the sum of its proper divisors (7837552392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4156196088 is a wasteful number, since it uses less digits than its factorization.
4156196088 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 938 (or 923 counting only the distinct ones).
The product of its (nonzero) digits is 414720, while the sum is 48.
The square root of 4156196088 is about 64468.5666662444. The cubic root of 4156196088 is about 1607.7999460285.
The spelling of 4156196088 in words is "four billion, one hundred fifty-six million, one hundred ninety-six thousand, eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •