Base | Representation |
---|---|
bin | 10010000101101010100… |
… | …011110100011001110001 |
3 | 11101211111010111102112201 |
4 | 102011222203310121301 |
5 | 130331213012314441 |
6 | 2351012554023201 |
7 | 155543344625332 |
oct | 22055243643161 |
9 | 4354433442481 |
10 | 1243033323121 |
11 | 43a1929a5747 |
12 | 180aa9417b01 |
13 | 902a9c1b205 |
14 | 4423d8d4289 |
15 | 22502b49c31 |
hex | 1216a8f4671 |
1243033323121 has 16 divisors (see below), whose sum is σ = 1269915023808. Its totient is φ = 1216369425600.
The previous prime is 1243033323113. The next prime is 1243033323149. The reversal of 1243033323121 is 1213233303421.
It is a cyclic number.
It is not a de Polignac number, because 1243033323121 - 23 = 1243033323113 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1243033323121.
It is not an unprimeable number, because it can be changed into a prime (1243033323221) 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 15 ways as a sum of consecutive naturals, for example, 19090206 + ... + 19155208.
It is an arithmetic number, because the mean of its divisors is an integer number (79369688988).
Almost surely, 21243033323121 is an apocalyptic number.
It is an amenable number.
1243033323121 is a deficient number, since it is larger than the sum of its proper divisors (26881700687).
1243033323121 is a wasteful number, since it uses less digits than its factorization.
1243033323121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66672.
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 1243033323121 its reverse (1213233303421), we get a palindrome (2456266626542).
The spelling of 1243033323121 in words is "one trillion, two hundred forty-three billion, thirty-three million, three hundred twenty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •