Base | Representation |
---|---|
bin | 1000101111000000001… |
… | …0101100011100110101 |
3 | 112100022200002000121222 |
4 | 2023300002230130311 |
5 | 4424303332020021 |
6 | 152533531320125 |
7 | 13561350012446 |
oct | 2136002543465 |
9 | 470280060558 |
10 | 150056126261 |
11 | 58702853698 |
12 | 250b95b0045 |
13 | 111c50a1172 |
14 | 73970012cd |
15 | 3d839b96ab |
hex | 22f00ac735 |
150056126261 has 2 divisors, whose sum is σ = 150056126262. Its totient is φ = 150056126260.
The previous prime is 150056126251. The next prime is 150056126287. The reversal of 150056126261 is 162621650051.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 119927845636 + 30128280625 = 346306^2 + 173575^2 .
It is a cyclic number.
It is not a de Polignac number, because 150056126261 - 230 = 148982384437 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (150056126251) 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, 75028063130 + 75028063131.
It is an arithmetic number, because the mean of its divisors is an integer number (75028063131).
Almost surely, 2150056126261 is an apocalyptic number.
It is an amenable number.
150056126261 is a deficient number, since it is larger than the sum of its proper divisors (1).
150056126261 is an equidigital number, since it uses as much as digits as its factorization.
150056126261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21600, while the sum is 35.
The spelling of 150056126261 in words is "one hundred fifty billion, fifty-six million, one hundred twenty-six thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •