Base | Representation |
---|---|
bin | 10001111101010… |
… | …01100110010000 |
3 | 101111110100122210 |
4 | 20332221212100 |
5 | 302031003130 |
6 | 22540432120 |
7 | 3506266464 |
oct | 1076514620 |
9 | 344410583 |
10 | 150641040 |
11 | 7803a930 |
12 | 42548640 |
13 | 25294914 |
14 | 160144a4 |
15 | d3595b0 |
hex | 8fa9990 |
150641040 has 160 divisors (see below), whose sum is σ = 521680896. Its totient is φ = 35642880.
The previous prime is 150641033. The next prime is 150641069. The reversal of 150641040 is 40146051.
It is a junction number, because it is equal to n+sod(n) for n = 150640998 and 150641016.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 112857 + ... + 114183.
Almost surely, 2150641040 is an apocalyptic number.
150641040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 150641040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (260840448).
150641040 is an abundant number, since it is smaller than the sum of its proper divisors (371039856).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150641040 is a wasteful number, since it uses less digits than its factorization.
150641040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1397 (or 1391 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 21.
The square root of 150641040 is about 12273.5911615142. The cubic root of 150641040 is about 532.0851051969.
Adding to 150641040 its reverse (40146051), we get a palindrome (190787091).
The spelling of 150641040 in words is "one hundred fifty million, six hundred forty-one thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •