Base | Representation |
---|---|
bin | 1001010001010011100… |
… | …0001001011101100000 |
3 | 120020002101102011121220 |
4 | 2110110320021131200 |
5 | 10102133044144323 |
6 | 201055341215040 |
7 | 14335466054250 |
oct | 2242470113540 |
9 | 506071364556 |
10 | 159264053088 |
11 | 615a8451378 |
12 | 26a49261480 |
13 | 1203195278a |
14 | 79cbc9d960 |
15 | 42220690e3 |
hex | 2514e09760 |
159264053088 has 192 divisors, whose sum is σ = 484545116160. Its totient is φ = 44862584832.
The previous prime is 159264053083. The next prime is 159264053101. The reversal of 159264053088 is 880350462951.
It is a self number, because there is not a number n which added to its sum of digits gives 159264053088.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (159264053083) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 45282306 + ... + 45285822.
It is an arithmetic number, because the mean of its divisors is an integer number (2523672480).
Almost surely, 2159264053088 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 159264053088, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (242272558080).
159264053088 is an abundant number, since it is smaller than the sum of its proper divisors (325281063072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
159264053088 is a wasteful number, since it uses less digits than its factorization.
159264053088 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4469 (or 4461 counting only the distinct ones).
The product of its (nonzero) digits is 2073600, while the sum is 51.
The spelling of 159264053088 in words is "one hundred fifty-nine billion, two hundred sixty-four million, fifty-three thousand, eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •