Base | Representation |
---|---|
bin | 10001111101011… |
… | …11001111010111 |
3 | 101111111112100202 |
4 | 20332233033113 |
5 | 302032223101 |
6 | 22541131115 |
7 | 3506424041 |
oct | 1076571727 |
9 | 344445322 |
10 | 150664151 |
11 | 78056230 |
12 | 42559a9b |
13 | 252a22b1 |
14 | 1601ca91 |
15 | d36136b |
hex | 8faf3d7 |
150664151 has 4 divisors (see below), whose sum is σ = 164360904. Its totient is φ = 136967400.
The previous prime is 150664133. The next prime is 150664159. The reversal of 150664151 is 151466051.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 151466051 = 11 ⋅13769641.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-150664151 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150664159) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6848360 + ... + 6848381.
It is an arithmetic number, because the mean of its divisors is an integer number (41090226).
Almost surely, 2150664151 is an apocalyptic number.
150664151 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
150664151 is a deficient number, since it is larger than the sum of its proper divisors (13696753).
150664151 is a wasteful number, since it uses less digits than its factorization.
150664151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13696752.
The product of its (nonzero) digits is 3600, while the sum is 29.
The square root of 150664151 is about 12274.5326183933. The cubic root of 150664151 is about 532.1123142276.
The spelling of 150664151 in words is "one hundred fifty million, six hundred sixty-four thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.198 sec. • engine limits •