Base | Representation |
---|---|
bin | 1000101111100101011… |
… | …0111011001011110101 |
3 | 112100201120011210102022 |
4 | 2023321112323023311 |
5 | 4430113340040222 |
6 | 153001233322525 |
7 | 13565255353325 |
oct | 2137126731365 |
9 | 470646153368 |
10 | 150212424437 |
11 | 58782aa7839 |
12 | 25141a06445 |
13 | 1121b5969aa |
14 | 73ada89285 |
15 | 3d92590042 |
hex | 22f95bb2f5 |
150212424437 has 2 divisors, whose sum is σ = 150212424438. Its totient is φ = 150212424436.
The previous prime is 150212424431. The next prime is 150212424451. The reversal of 150212424437 is 734424212051.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 150151600036 + 60824401 = 387494^2 + 7799^2 .
It is a cyclic number.
It is not a de Polignac number, because 150212424437 - 218 = 150212162293 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 150212424397 and 150212424406.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (150212424431) 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, 75106212218 + 75106212219.
It is an arithmetic number, because the mean of its divisors is an integer number (75106212219).
Almost surely, 2150212424437 is an apocalyptic number.
It is an amenable number.
150212424437 is a deficient number, since it is larger than the sum of its proper divisors (1).
150212424437 is an equidigital number, since it uses as much as digits as its factorization.
150212424437 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 53760, while the sum is 35.
Adding to 150212424437 its reverse (734424212051), we get a palindrome (884636636488).
The spelling of 150212424437 in words is "one hundred fifty billion, two hundred twelve million, four hundred twenty-four thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •