Base | Representation |
---|---|
bin | 10001111011001… |
… | …11111100011111 |
3 | 101110221200210001 |
4 | 20331213330133 |
5 | 301443402002 |
6 | 22530555131 |
7 | 3504066463 |
oct | 1075477437 |
9 | 343850701 |
10 | 150372127 |
11 | 77976894 |
12 | 42438aa7 |
13 | 251cc3b9 |
14 | 15d844a3 |
15 | d304a87 |
hex | 8f67f1f |
150372127 has 2 divisors, whose sum is σ = 150372128. Its totient is φ = 150372126.
The previous prime is 150372113. The next prime is 150372169. The reversal of 150372127 is 721273051.
It is a weak prime.
It is an emirp because it is prime and its reverse (721273051) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 150372127 - 219 = 149847839 is a prime.
It is a super-2 number, since 2×1503721272 = 45223553157008258, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 150372095 and 150372104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (150372427) 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 as a sum of consecutive naturals, namely, 75186063 + 75186064.
It is an arithmetic number, because the mean of its divisors is an integer number (75186064).
Almost surely, 2150372127 is an apocalyptic number.
150372127 is a deficient number, since it is larger than the sum of its proper divisors (1).
150372127 is an equidigital number, since it uses as much as digits as its factorization.
150372127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2940, while the sum is 28.
The square root of 150372127 is about 12262.6313244752. The cubic root of 150372127 is about 531.7683039062.
The spelling of 150372127 in words is "one hundred fifty million, three hundred seventy-two thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •