Base | Representation |
---|---|
bin | 10001111001011… |
… | …01001011100110 |
3 | 101110111110121100 |
4 | 20330231023212 |
5 | 301413201210 |
6 | 22521500530 |
7 | 3502044651 |
oct | 1074551346 |
9 | 343443540 |
10 | 150131430 |
11 | 77821a69 |
12 | 42341746 |
13 | 25146987 |
14 | 15d20898 |
15 | d2a85c0 |
hex | 8f2d2e6 |
150131430 has 48 divisors (see below), whose sum is σ = 394748640. Its totient is φ = 39583104.
The previous prime is 150131413. The next prime is 150131441. The reversal of 150131430 is 34131051.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1362 + ... + 17381.
It is an arithmetic number, because the mean of its divisors is an integer number (8223930).
Almost surely, 2150131430 is an apocalyptic number.
150131430 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 150131430, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (197374320).
150131430 is an abundant number, since it is smaller than the sum of its proper divisors (244617210).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150131430 is a wasteful number, since it uses less digits than its factorization.
150131430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18845 (or 18842 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 18.
The square root of 150131430 is about 12252.8131463758. The cubic root of 150131430 is about 531.4844228625.
Adding to 150131430 its reverse (34131051), we get a palindrome (184262481).
The spelling of 150131430 in words is "one hundred fifty million, one hundred thirty-one thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •