Base | Representation |
---|---|
bin | 10001111101001… |
… | …00101101111011 |
3 | 101111102100020110 |
4 | 20332210231323 |
5 | 302024333201 |
6 | 22540155403 |
7 | 3506154300 |
oct | 1076445573 |
9 | 344370213 |
10 | 150621051 |
11 | 78026909 |
12 | 42538b63 |
13 | 252887a9 |
14 | 1600b0a7 |
15 | d3536d6 |
hex | 8fa4b7b |
150621051 has 12 divisors (see below), whose sum is σ = 233616552. Its totient is φ = 86069088.
The previous prime is 150621001. The next prime is 150621059. The reversal of 150621051 is 150126051.
It is not a de Polignac number, because 150621051 - 210 = 150620027 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (150621059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 512170 + ... + 512463.
It is an arithmetic number, because the mean of its divisors is an integer number (19468046).
Almost surely, 2150621051 is an apocalyptic number.
150621051 is a deficient number, since it is larger than the sum of its proper divisors (82995501).
150621051 is a wasteful number, since it uses less digits than its factorization.
150621051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1024650 (or 1024643 counting only the distinct ones).
The product of its (nonzero) digits is 300, while the sum is 21.
The square root of 150621051 is about 12272.7768251525. The cubic root of 150621051 is about 532.0615695131.
The spelling of 150621051 in words is "one hundred fifty million, six hundred twenty-one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •