Base | Representation |
---|---|
bin | 100010001110011001010110… |
… | …100000010001110110101000 |
3 | 201201221211211222022221010111 |
4 | 202032121112200101312220 |
5 | 124212131322020023203 |
6 | 1252045130525224104 |
7 | 43463630111233420 |
oct | 4216312640216650 |
9 | 651854758287114 |
10 | 150522875157928 |
11 | 43a634359a3459 |
12 | 14a70412402034 |
13 | 65cb327c44ca0 |
14 | 29254bb711480 |
15 | 12606a341226d |
hex | 88e656811da8 |
150522875157928 has 256 divisors, whose sum is σ = 356516536320000. Its totient is φ = 58001617935360.
The previous prime is 150522875157899. The next prime is 150522875157937. The reversal of 150522875157928 is 829751578225051.
It is a Harshad number since it is a multiple of its sum of digits (67).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1555759698 + ... + 1555856446.
It is an arithmetic number, because the mean of its divisors is an integer number (1392642720000).
Almost surely, 2150522875157928 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 150522875157928, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (178258268160000).
150522875157928 is an abundant number, since it is smaller than the sum of its proper divisors (205993661162072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150522875157928 is a wasteful number, since it uses less digits than its factorization.
150522875157928 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 97200 (or 97196 counting only the distinct ones).
The product of its (nonzero) digits is 141120000, while the sum is 67.
The spelling of 150522875157928 in words is "one hundred fifty trillion, five hundred twenty-two billion, eight hundred seventy-five million, one hundred fifty-seven thousand, nine hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •