Base | Representation |
---|---|
bin | 111011110101111001011… |
… | …101010100111000011001 |
3 | 112120010121202021200212102 |
4 | 323311321131110320121 |
5 | 1014334013241324423 |
6 | 12425101400053145 |
7 | 603051105303125 |
oct | 73657135247031 |
9 | 15503552250772 |
10 | 4112321433113 |
11 | 1346031271843 |
12 | 564bb41641b5 |
13 | 23aa372332aa |
14 | 103074970585 |
15 | 71e86ca9c28 |
hex | 3bd79754e19 |
4112321433113 has 2 divisors, whose sum is σ = 4112321433114. Its totient is φ = 4112321433112.
The previous prime is 4112321433091. The next prime is 4112321433169. The reversal of 4112321433113 is 3113341232114.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3337625724889 + 774695708224 = 1826917^2 + 880168^2 .
It is a cyclic number.
It is not a de Polignac number, because 4112321433113 - 26 = 4112321433049 is a prime.
It is a super-3 number, since 3×41123214331133 (a number of 39 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (4112321433013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2056160716556 + 2056160716557.
It is an arithmetic number, because the mean of its divisors is an integer number (2056160716557).
Almost surely, 24112321433113 is an apocalyptic number.
It is an amenable number.
4112321433113 is a deficient number, since it is larger than the sum of its proper divisors (1).
4112321433113 is an equidigital number, since it uses as much as digits as its factorization.
4112321433113 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5184, while the sum is 29.
Adding to 4112321433113 its reverse (3113341232114), we get a palindrome (7225662665227).
The spelling of 4112321433113 in words is "four trillion, one hundred twelve billion, three hundred twenty-one million, four hundred thirty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •