Base | Representation |
---|---|
bin | 10001111101010… |
… | …01110111000111 |
3 | 101111110102010202 |
4 | 20332221313013 |
5 | 302031021434 |
6 | 22540441115 |
7 | 3506302565 |
oct | 1076516707 |
9 | 344412122 |
10 | 150642119 |
11 | 78040721 |
12 | 4254919b |
13 | 25295264 |
14 | 16014a35 |
15 | d359a7e |
hex | 8fa9dc7 |
150642119 has 2 divisors, whose sum is σ = 150642120. Its totient is φ = 150642118.
The previous prime is 150642101. The next prime is 150642169. The reversal of 150642119 is 911246051.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 150642119 - 224 = 133864903 is a prime.
It is a super-2 number, since 2×1506421192 = 45386096033620322, which contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 150642091 and 150642100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (150642169) 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 as a sum of consecutive naturals, namely, 75321059 + 75321060.
It is an arithmetic number, because the mean of its divisors is an integer number (75321060).
Almost surely, 2150642119 is an apocalyptic number.
150642119 is a deficient number, since it is larger than the sum of its proper divisors (1).
150642119 is an equidigital number, since it uses as much as digits as its factorization.
150642119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 29.
The square root of 150642119 is about 12273.6351176007. The cubic root of 150642119 is about 532.0863755865.
The spelling of 150642119 in words is "one hundred fifty million, six hundred forty-two thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •