Base | Representation |
---|---|
bin | 1110001001010111010… |
… | …1111011100000010100 |
3 | 212020022022210102111220 |
4 | 3202111311323200110 |
5 | 12440212210023444 |
6 | 303351501330340 |
7 | 23362363600635 |
oct | 3422565734024 |
9 | 766268712456 |
10 | 243032111124 |
11 | 94084322200 |
12 | 3b126b669b0 |
13 | 19bc1619b1a |
14 | ba9725388c |
15 | 64c6244619 |
hex | 3895d7b814 |
243032111124 has 72 divisors (see below), whose sum is σ = 623431116000. Its totient is φ = 73632229440.
The previous prime is 243032111099. The next prime is 243032111221. The reversal of 243032111124 is 421111230342.
243032111124 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 243032111094 and 243032111103.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 9807502 + ... + 9832250.
It is an arithmetic number, because the mean of its divisors is an integer number (8658765500).
Almost surely, 2243032111124 is an apocalyptic number.
It is an amenable number.
243032111124 is an abundant number, since it is smaller than the sum of its proper divisors (380399004876).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
243032111124 is a wasteful number, since it uses less digits than its factorization.
243032111124 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31541 (or 31528 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 243032111124 its reverse (421111230342), we get a palindrome (664143341466).
The spelling of 243032111124 in words is "two hundred forty-three billion, thirty-two million, one hundred eleven thousand, one hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •