Base | Representation |
---|---|
bin | 10010000000011… |
… | …01011000000000 |
3 | 101112020010021101 |
4 | 21000031120000 |
5 | 302132042403 |
6 | 22553304144 |
7 | 3512621134 |
oct | 1100153000 |
9 | 345203241 |
10 | 151049728 |
11 | 78299995 |
12 | 42705054 |
13 | 253a894b |
14 | 160bd3c4 |
15 | d3da71d |
hex | 900d600 |
151049728 has 40 divisors (see below), whose sum is σ = 308274912. Its totient is φ = 73906176.
The previous prime is 151049711. The next prime is 151049741. The reversal of 151049728 is 827940151.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20926 + ... + 27202.
Almost surely, 2151049728 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 151049728, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (154137456).
151049728 is an abundant number, since it is smaller than the sum of its proper divisors (157225184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
151049728 is an frugal number, since it uses more digits than its factorization.
151049728 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6342 (or 6326 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 37.
The square root of 151049728 is about 12290.2289645067. The cubic root of 151049728 is about 532.5658516576.
Adding to 151049728 its reverse (827940151), we get a palindrome (978989879).
The spelling of 151049728 in words is "one hundred fifty-one million, forty-nine thousand, seven hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •