Base | Representation |
---|---|
bin | 1000101111010111111… |
… | …1110111111001111111 |
3 | 112100120122002200021221 |
4 | 2023311333313321333 |
5 | 4430004422100142 |
6 | 152551501134211 |
7 | 13564002236443 |
oct | 2136577677177 |
9 | 470518080257 |
10 | 150156050047 |
11 | 587541a2933 |
12 | 25126b5a367 |
13 | 1120c9b9073 |
14 | 73a63b2823 |
15 | 3d8c656767 |
hex | 22f5ff7e7f |
150156050047 has 2 divisors, whose sum is σ = 150156050048. Its totient is φ = 150156050046.
The previous prime is 150156049993. The next prime is 150156050053. The reversal of 150156050047 is 740050651051.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 150156050047 - 211 = 150156047999 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 150156049994 and 150156050021.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (150156050147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75078025023 + 75078025024.
It is an arithmetic number, because the mean of its divisors is an integer number (75078025024).
Almost surely, 2150156050047 is an apocalyptic number.
150156050047 is a deficient number, since it is larger than the sum of its proper divisors (1).
150156050047 is an equidigital number, since it uses as much as digits as its factorization.
150156050047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21000, while the sum is 34.
The spelling of 150156050047 in words is "one hundred fifty billion, one hundred fifty-six million, fifty thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •