Base | Representation |
---|---|
bin | 10001111001011… |
… | …11110100101101 |
3 | 101110112000110012 |
4 | 20330233310231 |
5 | 301414023003 |
6 | 22522023005 |
7 | 3502121342 |
oct | 1074576455 |
9 | 343460405 |
10 | 150142253 |
11 | 7782a108 |
12 | 42347a65 |
13 | 2514b891 |
14 | 15d247c9 |
15 | d2ab8d8 |
hex | 8f2fd2d |
150142253 has 2 divisors, whose sum is σ = 150142254. Its totient is φ = 150142252.
The previous prime is 150142231. The next prime is 150142259. The reversal of 150142253 is 352241051.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 78180964 + 71961289 = 8842^2 + 8483^2 .
It is a cyclic number.
It is not a de Polignac number, because 150142253 - 28 = 150141997 is a prime.
It is a super-2 number, since 2×1501422532 = 45085392271832018, which contains 22 as substring.
It is equal to p8452004 and since 150142253 and 8452004 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (150142259) 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, 75071126 + 75071127.
It is an arithmetic number, because the mean of its divisors is an integer number (75071127).
Almost surely, 2150142253 is an apocalyptic number.
It is an amenable number.
150142253 is a deficient number, since it is larger than the sum of its proper divisors (1).
150142253 is an equidigital number, since it uses as much as digits as its factorization.
150142253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1200, while the sum is 23.
The square root of 150142253 is about 12253.2547920950. The cubic root of 150142253 is about 531.4971941560.
The spelling of 150142253 in words is "one hundred fifty million, one hundred forty-two thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •