Base | Representation |
---|---|
bin | 1000101111010010010… |
… | …0111111011110101001 |
3 | 112100111222021021210101 |
4 | 2023310210333132221 |
5 | 4424432322212321 |
6 | 152545250345401 |
7 | 13563262602454 |
oct | 2136444773651 |
9 | 470458237711 |
10 | 150132225961 |
11 | 58741800503 |
12 | 2511ab8b261 |
13 | 11207a97183 |
14 | 73a317049b |
15 | 3d8a4ec791 |
hex | 22f493f7a9 |
150132225961 has 27 divisors (see below), whose sum is σ = 161038884279. Its totient is φ = 139953802800.
The previous prime is 150132225959. The next prime is 150132225967. The reversal of 150132225961 is 169522231051.
The square root of 150132225961 is 387469.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 78725697561 + 71406528400 = 280581^2 + 267220^2 .
It is not a de Polignac number, because 150132225961 - 21 = 150132225959 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 150132225961.
It is not an unprimeable number, because it can be changed into a prime (150132225967) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 348334416 + ... + 348334846.
Almost surely, 2150132225961 is an apocalyptic number.
150132225961 is the 387469-th square number.
150132225961 is the 193735-th centered octagonal number.
It is an amenable number.
150132225961 is a deficient number, since it is larger than the sum of its proper divisors (10906658318).
150132225961 is an frugal number, since it uses more digits than its factorization.
150132225961 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 982 (or 491 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 37.
The spelling of 150132225961 in words is "one hundred fifty billion, one hundred thirty-two million, two hundred twenty-five thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •