Base | Representation |
---|---|
bin | 10001111110001… |
… | …00011110000001 |
3 | 101111122221122021 |
4 | 20333010132001 |
5 | 302043013410 |
6 | 22543041441 |
7 | 3510235411 |
oct | 1077043601 |
9 | 344587567 |
10 | 150751105 |
11 | 7810559a |
12 | 425a0281 |
13 | 25302a4b |
14 | 16042641 |
15 | d37beda |
hex | 8fc4781 |
150751105 has 12 divisors (see below), whose sum is σ = 183515796. Its totient is φ = 118882400.
The previous prime is 150751103. The next prime is 150751141. The reversal of 150751105 is 501157051.
It can be written as a sum of positive squares in 2 ways, for example, as 23309584 + 127441521 = 4828^2 + 11289^2 .
It is not a de Polignac number, because 150751105 - 21 = 150751103 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 150751105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150751103) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 22215 + ... + 28195.
It is an arithmetic number, because the mean of its divisors is an integer number (15292983).
Almost surely, 2150751105 is an apocalyptic number.
It is an amenable number.
150751105 is a deficient number, since it is larger than the sum of its proper divisors (32764691).
150751105 is an frugal number, since it uses more digits than its factorization.
150751105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6128 (or 6057 counting only the distinct ones).
The product of its (nonzero) digits is 875, while the sum is 25.
The square root of 150751105 is about 12278.0741568049. The cubic root of 150751105 is about 532.2146619448.
The spelling of 150751105 in words is "one hundred fifty million, seven hundred fifty-one thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •