Base | Representation |
---|---|
bin | 1000110010001100110… |
… | …1010011100110000000 |
3 | 112102112111100021012102 |
4 | 2030203031103212000 |
5 | 4433033110433143 |
6 | 153155034245532 |
7 | 13621542322160 |
oct | 2144315234600 |
9 | 472474307172 |
10 | 150914546048 |
11 | 59003366132 |
12 | 252b8b868a8 |
13 | 11300b99976 |
14 | 74390165a0 |
15 | 3dd40310b8 |
hex | 2323353980 |
150914546048 has 64 divisors (see below), whose sum is σ = 344064049920. Its totient is φ = 64590328320.
The previous prime is 150914545993. The next prime is 150914546051. The reversal of 150914546048 is 840645419051.
It is a tau number, because it is divible by the number of its divisors (64).
It is a junction number, because it is equal to n+sod(n) for n = 150914545993 and 150914546011.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 552383 + ... + 779073.
It is an arithmetic number, because the mean of its divisors is an integer number (5376000780).
Almost surely, 2150914546048 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 150914546048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (172032024960).
150914546048 is an abundant number, since it is smaller than the sum of its proper divisors (193149503872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150914546048 is an equidigital number, since it uses as much as digits as its factorization.
150914546048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 227455 (or 227443 counting only the distinct ones).
The product of its (nonzero) digits is 691200, while the sum is 47.
The spelling of 150914546048 in words is "one hundred fifty billion, nine hundred fourteen million, five hundred forty-six thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •