Base | Representation |
---|---|
bin | 11100111111000… |
… | …01101100111100 |
3 | 121221112001222002 |
4 | 32133201230330 |
5 | 444221124112 |
6 | 40043241432 |
7 | 6011463050 |
oct | 1637415474 |
9 | 557461862 |
10 | 243145532 |
11 | 115281923 |
12 | 69519278 |
13 | 3b4b27c6 |
14 | 24413c60 |
15 | 1652d1c2 |
hex | e7e1b3c |
243145532 has 12 divisors (see below), whose sum is σ = 486291120. Its totient is φ = 104205216.
The previous prime is 243145531. The next prime is 243145547. The reversal of 243145532 is 235541342.
It is a happy number.
243145532 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 243145495 and 243145504.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (243145531) 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 in 3 ways as a sum of consecutive naturals, for example, 4341857 + ... + 4341912.
It is an arithmetic number, because the mean of its divisors is an integer number (40524260).
Almost surely, 2243145532 is an apocalyptic number.
It is an amenable number.
243145532 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
243145532 is a wasteful number, since it uses less digits than its factorization.
243145532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8683780 (or 8683778 counting only the distinct ones).
The product of its digits is 14400, while the sum is 29.
The square root of 243145532 is about 15593.1245105014. The cubic root of 243145532 is about 624.1496976755.
Adding to 243145532 its reverse (235541342), we get a palindrome (478686874).
The spelling of 243145532 in words is "two hundred forty-three million, one hundred forty-five thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •