Base | Representation |
---|---|
bin | 1110001001101101001… |
… | …0011000010011101011 |
3 | 212020112200200012001020 |
4 | 3202123102120103223 |
5 | 12440404101031321 |
6 | 303404523223523 |
7 | 23364553162140 |
oct | 3423322302353 |
9 | 766480605036 |
10 | 243123455211 |
11 | 9412094138a |
12 | 3b151677ba3 |
13 | 19c0751c790 |
14 | baa54303c7 |
15 | 64ce2894c6 |
hex | 389b4984eb |
243123455211 has 64 divisors (see below), whose sum is σ = 415631139840. Its totient is φ = 122992220160.
The previous prime is 243123455153. The next prime is 243123455219. The reversal of 243123455211 is 112554321342.
243123455211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 243123455211 - 27 = 243123455083 is a prime.
It is not an unprimeable number, because it can be changed into a prime (243123455219) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 476311 + ... + 844463.
It is an arithmetic number, because the mean of its divisors is an integer number (6494236560).
Almost surely, 2243123455211 is an apocalyptic number.
243123455211 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
243123455211 is a deficient number, since it is larger than the sum of its proper divisors (172507684629).
243123455211 is a wasteful number, since it uses less digits than its factorization.
243123455211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 368276.
The product of its digits is 28800, while the sum is 33.
Adding to 243123455211 its reverse (112554321342), we get a palindrome (355677776553).
The spelling of 243123455211 in words is "two hundred forty-three billion, one hundred twenty-three million, four hundred fifty-five thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •