Base | Representation |
---|---|
bin | 10001111100011… |
… | …00110001000100 |
3 | 101111020100200000 |
4 | 20332030301010 |
5 | 302013213243 |
6 | 22534121300 |
7 | 3505265262 |
oct | 1076146104 |
9 | 344210600 |
10 | 150522948 |
11 | 77a6a134 |
12 | 424b0230 |
13 | 25252c44 |
14 | 15dc3432 |
15 | d3345d3 |
hex | 8f8cc44 |
150522948 has 72 divisors (see below), whose sum is σ = 411797568. Its totient is φ = 47985696.
The previous prime is 150522923. The next prime is 150523001. The reversal of 150522948 is 849225051.
It is a super-2 number, since 2×1505229482 = 45314315749221408, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
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, 18990 + ... + 25722.
Almost surely, 2150522948 is an apocalyptic number.
150522948 is a gapful number since it is divisible by the number (18) 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 150522948, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (205898784).
150522948 is an abundant number, since it is smaller than the sum of its proper divisors (261274620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150522948 is a wasteful number, since it uses less digits than its factorization.
150522948 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6775 (or 6761 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 36.
The square root of 150522948 is about 12268.7794013912. The cubic root of 150522948 is about 531.9460297258.
Adding to 150522948 its reverse (849225051), we get a palindrome (999747999).
The spelling of 150522948 in words is "one hundred fifty million, five hundred twenty-two thousand, nine hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •