Base | Representation |
---|---|
bin | 100010001110110100011001… |
… | …100101010000111101001011 |
3 | 201202001121211000020022210121 |
4 | 202032310121211100331023 |
5 | 124213120311430411432 |
6 | 1252110332442324111 |
7 | 43466005604650615 |
oct | 4216643145207513 |
9 | 652047730208717 |
10 | 150551917825867 |
11 | 43a74789806768 |
12 | 14a75b787b9637 |
13 | 6600ca5b8bbbc |
14 | 2926a74957db5 |
15 | 1261302e87197 |
hex | 88ed19950f4b |
150551917825867 has 2 divisors, whose sum is σ = 150551917825868. Its totient is φ = 150551917825866.
The previous prime is 150551917825823. The next prime is 150551917825879. The reversal of 150551917825867 is 768528719155051.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-150551917825867 is a prime.
It is a super-2 number, since 2×1505519178258672 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 150551917825796 and 150551917825805.
It is not a weakly prime, because it can be changed into another prime (150551917829867) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75275958912933 + 75275958912934.
It is an arithmetic number, because the mean of its divisors is an integer number (75275958912934).
Almost surely, 2150551917825867 is an apocalyptic number.
150551917825867 is a deficient number, since it is larger than the sum of its proper divisors (1).
150551917825867 is an equidigital number, since it uses as much as digits as its factorization.
150551917825867 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 211680000, while the sum is 70.
The spelling of 150551917825867 in words is "one hundred fifty trillion, five hundred fifty-one billion, nine hundred seventeen million, eight hundred twenty-five thousand, eight hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •