Base | Representation |
---|---|
bin | 1000110001010011000… |
… | …0101100010101011101 |
3 | 112101220121020222210112 |
4 | 2030110300230111131 |
5 | 4432034033223224 |
6 | 153115015215405 |
7 | 13612540156421 |
oct | 2142460542535 |
9 | 471817228715 |
10 | 150672164189 |
11 | 58999566048 |
12 | 2524b977565 |
13 | 112928c3951 |
14 | 7414b60b81 |
15 | 3dbcb0430e |
hex | 2314c2c55d |
150672164189 has 2 divisors, whose sum is σ = 150672164190. Its totient is φ = 150672164188.
The previous prime is 150672164179. The next prime is 150672164191. The reversal of 150672164189 is 981461276051.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 150421416964 + 250747225 = 387842^2 + 15835^2 .
It is a cyclic number.
It is not a de Polignac number, because 150672164189 - 28 = 150672163933 is a prime.
It is a super-2 number, since 2×1506721641892 (a number of 23 digits) contains 22 as substring.
Together with 150672164191, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (150672164179) 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, 75336082094 + 75336082095.
It is an arithmetic number, because the mean of its divisors is an integer number (75336082095).
Almost surely, 2150672164189 is an apocalyptic number.
It is an amenable number.
150672164189 is a deficient number, since it is larger than the sum of its proper divisors (1).
150672164189 is an equidigital number, since it uses as much as digits as its factorization.
150672164189 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 725760, while the sum is 50.
The spelling of 150672164189 in words is "one hundred fifty billion, six hundred seventy-two million, one hundred sixty-four thousand, one hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •