Base | Representation |
---|---|
bin | 10001011001011… |
… | …01011101000001 |
3 | 101011121102122001 |
4 | 20230231131001 |
5 | 244330010431 |
6 | 22251544001 |
7 | 3421311631 |
oct | 1054553501 |
9 | 334542561 |
10 | 145938241 |
11 | 75418619 |
12 | 40a5b001 |
13 | 243091b7 |
14 | 1554c6c1 |
15 | cc2ae61 |
hex | 8b2d741 |
145938241 has 4 divisors (see below), whose sum is σ = 146398932. Its totient is φ = 145477552.
The previous prime is 145938239. The next prime is 145938253. The reversal of 145938241 is 142839541.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 24850225 + 121088016 = 4985^2 + 11004^2 .
It is a cyclic number.
It is not a de Polignac number, because 145938241 - 21 = 145938239 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 145938241.
It is not an unprimeable number, because it can be changed into a prime (145938271) 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 in 3 ways as a sum of consecutive naturals, for example, 229870 + ... + 230503.
It is an arithmetic number, because the mean of its divisors is an integer number (36599733).
Almost surely, 2145938241 is an apocalyptic number.
It is an amenable number.
145938241 is a deficient number, since it is larger than the sum of its proper divisors (460691).
145938241 is an equidigital number, since it uses as much as digits as its factorization.
145938241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 460690.
The product of its digits is 34560, while the sum is 37.
The square root of 145938241 is about 12080.4900976740. The cubic root of 145938241 is about 526.4894856558.
The spelling of 145938241 in words is "one hundred forty-five million, nine hundred thirty-eight thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •