Base | Representation |
---|---|
bin | 1110001001101001111… |
… | …1111101111110000100 |
3 | 212020111202210210100212 |
4 | 3202122133331332010 |
5 | 12440342210141012 |
6 | 303403332054552 |
7 | 23364332642204 |
oct | 3423237757604 |
9 | 766452723325 |
10 | 243110240132 |
11 | 94114435731 |
12 | 3b149164458 |
13 | 19c048736c6 |
14 | baa3790404 |
15 | 64cd028b22 |
hex | 389a7fdf84 |
243110240132 has 12 divisors (see below), whose sum is σ = 435819577116. Its totient is φ = 118590360960.
The previous prime is 243110240123. The next prime is 243110240161. The reversal of 243110240132 is 231042011342.
It can be written as a sum of positive squares in 2 ways, for example, as 15985556356 + 227124683776 = 126434^2 + 476576^2 .
It is a super-3 number, since 3×2431102401323 (a number of 35 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 243110240098 and 243110240107.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 741189593 + ... + 741189920.
It is an arithmetic number, because the mean of its divisors is an integer number (36318298093).
Almost surely, 2243110240132 is an apocalyptic number.
It is an amenable number.
243110240132 is a deficient number, since it is larger than the sum of its proper divisors (192709336984).
243110240132 is a wasteful number, since it uses less digits than its factorization.
243110240132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1482379558 (or 1482379556 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 243110240132 its reverse (231042011342), we get a palindrome (474152251474).
The spelling of 243110240132 in words is "two hundred forty-three billion, one hundred ten million, two hundred forty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •