Base | Representation |
---|---|
bin | 11100111110110… |
… | …01101001011000 |
3 | 121221110101201000 |
4 | 32133121221120 |
5 | 444214100121 |
6 | 40042425000 |
7 | 6011264622 |
oct | 1637315130 |
9 | 557411630 |
10 | 243112536 |
11 | 11525a057 |
12 | 69502160 |
13 | 3b4a0794 |
14 | 24405c12 |
15 | 16523526 |
hex | e7d9a58 |
243112536 has 64 divisors (see below), whose sum is σ = 676800000. Its totient is φ = 80859168.
The previous prime is 243112531. The next prime is 243112559. The reversal of 243112536 is 635211342.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (243112531) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 128445 + ... + 130323.
It is an arithmetic number, because the mean of its divisors is an integer number (10575000).
Almost surely, 2243112536 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 243112536, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (338400000).
243112536 is an abundant number, since it is smaller than the sum of its proper divisors (433687464).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
243112536 is a wasteful number, since it uses less digits than its factorization.
243112536 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2493 (or 2483 counting only the distinct ones).
The product of its digits is 4320, while the sum is 27.
The square root of 243112536 is about 15592.0664441889. The cubic root of 243112536 is about 624.1214630418.
Adding to 243112536 its reverse (635211342), we get a palindrome (878323878).
The spelling of 243112536 in words is "two hundred forty-three million, one hundred twelve thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •