Base | Representation |
---|---|
bin | 10001010110010… |
… | …10010011100011 |
3 | 101010211210112221 |
4 | 20223022103203 |
5 | 244224012011 |
6 | 22235131511 |
7 | 3415000633 |
oct | 1053122343 |
9 | 333753487 |
10 | 145532131 |
11 | 75170498 |
12 | 408a3b97 |
13 | 241c63b4 |
14 | 154846c3 |
15 | cb9a971 |
hex | 8aca4e3 |
145532131 has 2 divisors, whose sum is σ = 145532132. Its totient is φ = 145532130.
The previous prime is 145532129. The next prime is 145532171. The reversal of 145532131 is 131235541.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 145532131 - 21 = 145532129 is a prime.
It is a super-2 number, since 2×1455321312 = 42359202306802322, which contains 22 as substring.
Together with 145532129, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 145532096 and 145532105.
It is not a weakly prime, because it can be changed into another prime (145532111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72766065 + 72766066.
It is an arithmetic number, because the mean of its divisors is an integer number (72766066).
Almost surely, 2145532131 is an apocalyptic number.
145532131 is a deficient number, since it is larger than the sum of its proper divisors (1).
145532131 is an equidigital number, since it uses as much as digits as its factorization.
145532131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1800, while the sum is 25.
The square root of 145532131 is about 12063.6698810934. The cubic root of 145532131 is about 526.0006686513. Note that the first 3 decimals are identical.
Adding to 145532131 its reverse (131235541), we get a palindrome (276767672).
The spelling of 145532131 in words is "one hundred forty-five million, five hundred thirty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •