Base | Representation |
---|---|
bin | 10001111010100… |
… | …01110100010010 |
3 | 101110210002110010 |
4 | 20331101310102 |
5 | 301433001430 |
6 | 22525015350 |
7 | 3503241312 |
oct | 1075216422 |
9 | 343702403 |
10 | 150281490 |
11 | 77914787 |
12 | 423b4556 |
13 | 2519a078 |
14 | 15d5d442 |
15 | d2d7cb0 |
hex | 8f51d12 |
150281490 has 64 divisors (see below), whose sum is σ = 374280192. Its totient is φ = 38577600.
The previous prime is 150281489. The next prime is 150281501. The reversal of 150281490 is 94182051.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a Curzon number.
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, 262905 + ... + 263475.
It is an arithmetic number, because the mean of its divisors is an integer number (5848128).
Almost surely, 2150281490 is an apocalyptic number.
150281490 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 150281490, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (187140096).
150281490 is an abundant number, since it is smaller than the sum of its proper divisors (223998702).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150281490 is a wasteful number, since it uses less digits than its factorization.
150281490 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 895.
The product of its (nonzero) digits is 2880, while the sum is 30.
The square root of 150281490 is about 12258.9351087278. The cubic root of 150281490 is about 531.6614410814.
The spelling of 150281490 in words is "one hundred fifty million, two hundred eighty-one thousand, four hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •