Base | Representation |
---|---|
bin | 1110001001101100110… |
… | …1000001001110110000 |
3 | 212020112121000210102012 |
4 | 3202123031001032300 |
5 | 12440403221044333 |
6 | 303404433142052 |
7 | 23364535220210 |
oct | 3423315011660 |
9 | 766477023365 |
10 | 243122049968 |
11 | 94120071626 |
12 | 3b1510ba928 |
13 | 19c07149c85 |
14 | baa5186240 |
15 | 64ce0ace48 |
hex | 389b3413b0 |
243122049968 has 20 divisors (see below), whose sum is σ = 538341682320. Its totient is φ = 104195164224.
The previous prime is 243122049967. The next prime is 243122049979. The reversal of 243122049968 is 869940221342.
243122049968 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (243122049967) 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, 1085366183 + ... + 1085366406.
It is an arithmetic number, because the mean of its divisors is an integer number (26917084116).
Almost surely, 2243122049968 is an apocalyptic number.
243122049968 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
243122049968 is an abundant number, since it is smaller than the sum of its proper divisors (295219632352).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
243122049968 is a wasteful number, since it uses less digits than its factorization.
243122049968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2170732604 (or 2170732598 counting only the distinct ones).
The product of its (nonzero) digits is 1492992, while the sum is 50.
The spelling of 243122049968 in words is "two hundred forty-three billion, one hundred twenty-two million, forty-nine thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •