Base | Representation |
---|---|
bin | 10001111010110… |
… | …01101100000000 |
3 | 101110211201200010 |
4 | 20331121230000 |
5 | 301440014403 |
6 | 22525424520 |
7 | 3503434305 |
oct | 1075315400 |
9 | 343751603 |
10 | 150313728 |
11 | 77936a24 |
12 | 4240b140 |
13 | 251ab946 |
14 | 15d6b0ac |
15 | d2e2603 |
hex | 8f59b00 |
150313728 has 144 divisors (see below), whose sum is σ = 439296480. Its totient is φ = 45416448.
The previous prime is 150313687. The next prime is 150313729. The reversal of 150313728 is 827313051.
It is a junction number, because it is equal to n+sod(n) for n = 150313695 and 150313704.
It is not an unprimeable number, because it can be changed into a prime (150313729) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 378426 + ... + 378822.
It is an arithmetic number, because the mean of its divisors is an integer number (3050670).
Almost surely, 2150313728 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 150313728, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (219648240).
150313728 is an abundant number, since it is smaller than the sum of its proper divisors (288982752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150313728 is a wasteful number, since it uses less digits than its factorization.
150313728 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 462 (or 448 counting only the distinct ones).
The product of its (nonzero) digits is 5040, while the sum is 30.
The square root of 150313728 is about 12260.2499158867. The cubic root of 150313728 is about 531.6994552465.
Adding to 150313728 its reverse (827313051), we get a palindrome (977626779).
The spelling of 150313728 in words is "one hundred fifty million, three hundred thirteen thousand, seven hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •