Base | Representation |
---|---|
bin | 1110001001101100111… |
… | …0000101101110110110 |
3 | 212020112121120001022010 |
4 | 3202123032011232312 |
5 | 12440403304034200 |
6 | 303404443145050 |
7 | 23364540466221 |
oct | 3423316055666 |
9 | 766477501263 |
10 | 243122330550 |
11 | 94120243410 |
12 | 3b151215186 |
13 | 19c072178b8 |
14 | baa521a5b8 |
15 | 64ce116150 |
hex | 389b385bb6 |
243122330550 has 48 divisors (see below), whose sum is σ = 657756418752. Its totient is φ = 58938746400.
The previous prime is 243122330533. The next prime is 243122330569. The reversal of 243122330550 is 55033221342.
243122330550 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2431223305502 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 73671784 + ... + 73675083.
It is an arithmetic number, because the mean of its divisors is an integer number (13703258724).
Almost surely, 2243122330550 is an apocalyptic number.
243122330550 is an abundant number, since it is smaller than the sum of its proper divisors (414634088202).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
243122330550 is a wasteful number, since it uses less digits than its factorization.
243122330550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 147346893 (or 147346888 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 30.
Adding to 243122330550 its reverse (55033221342), we get a palindrome (298155551892).
The spelling of 243122330550 in words is "two hundred forty-three billion, one hundred twenty-two million, three hundred thirty thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •