Base | Representation |
---|---|
bin | 111101011101011110110… |
… | …011100000000110110001 |
3 | 112221202201000001120221020 |
4 | 331131132303200012301 |
5 | 1023144304103123441 |
6 | 12552134041050053 |
7 | 614066225436516 |
oct | 75353663400661 |
9 | 15852630046836 |
10 | 4223543411121 |
11 | 138921616a031 |
12 | 582674186929 |
13 | 24838094b1b8 |
14 | 1085c616530d |
15 | 74ce62cee66 |
hex | 3d75ece01b1 |
4223543411121 has 16 divisors (see below), whose sum is σ = 5640630222528. Its totient is φ = 2811076812800.
The previous prime is 4223543411051. The next prime is 4223543411123. The reversal of 4223543411121 is 1211143453224.
It is a cyclic number.
It is not a de Polignac number, because 4223543411121 - 29 = 4223543410609 is a prime.
It is a super-2 number, since 2×42235434111212 (a number of 26 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (4223543411123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 25796206 + ... + 25959416.
It is an arithmetic number, because the mean of its divisors is an integer number (352539388908).
Almost surely, 24223543411121 is an apocalyptic number.
It is an amenable number.
4223543411121 is a deficient number, since it is larger than the sum of its proper divisors (1417086811407).
4223543411121 is a wasteful number, since it uses less digits than its factorization.
4223543411121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 177312.
The product of its digits is 23040, while the sum is 33.
Adding to 4223543411121 its reverse (1211143453224), we get a palindrome (5434686864345).
The spelling of 4223543411121 in words is "four trillion, two hundred twenty-three billion, five hundred forty-three million, four hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •