Base | Representation |
---|---|
bin | 10001111011100… |
… | …00001101001000 |
3 | 101111000102012010 |
4 | 20331300031020 |
5 | 302000442320 |
6 | 22531415520 |
7 | 3504300225 |
oct | 1075601510 |
9 | 344012163 |
10 | 150405960 |
11 | 7799a251 |
12 | 424545a0 |
13 | 25211913 |
14 | 15d9294c |
15 | d30eae0 |
hex | 8f70348 |
150405960 has 64 divisors (see below), whose sum is σ = 456684480. Its totient is φ = 39622400.
The previous prime is 150405949. The next prime is 150405961. The reversal of 150405960 is 69504051.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is not an unprimeable number, because it can be changed into a prime (150405961) 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, 2410 + ... + 17510.
It is an arithmetic number, because the mean of its divisors is an integer number (7135695).
Almost surely, 2150405960 is an apocalyptic number.
150405960 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 150405960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (228342240).
150405960 is an abundant number, since it is smaller than the sum of its proper divisors (306278520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150405960 is a wasteful number, since it uses less digits than its factorization.
150405960 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15198 (or 15194 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 30.
The square root of 150405960 is about 12264.0107632047. The cubic root of 150405960 is about 531.8081826795.
The spelling of 150405960 in words is "one hundred fifty million, four hundred five thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •