Base | Representation |
---|---|
bin | 111011110101111000011… |
… | …011010010110010000011 |
3 | 112120010120112201020212112 |
4 | 323311320123102302003 |
5 | 1014333444323414021 |
6 | 12425055541045535 |
7 | 603050505206300 |
oct | 73657033226203 |
9 | 15503515636775 |
10 | 4112304123011 |
11 | 1346022519477 |
12 | 564baa3b68ab |
13 | 23aa33782326 |
14 | 1030725460a7 |
15 | 71e854dad5b |
hex | 3bd786d2c83 |
4112304123011 has 6 divisors (see below), whose sum is σ = 4783700714580. Its totient is φ = 3524832105396.
The previous prime is 4112304122977. The next prime is 4112304123013. The reversal of 4112304123011 is 1103214032114.
It is not a de Polignac number, because 4112304123011 - 214 = 4112304106627 is a prime.
It is a super-2 number, since 2×41123041230112 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4112304123013) 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 5 ways as a sum of consecutive naturals, for example, 41962286921 + ... + 41962287018.
It is an arithmetic number, because the mean of its divisors is an integer number (797283452430).
Almost surely, 24112304123011 is an apocalyptic number.
4112304123011 is a deficient number, since it is larger than the sum of its proper divisors (671396591569).
4112304123011 is an equidigital number, since it uses as much as digits as its factorization.
4112304123011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83924573953 (or 83924573946 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 4112304123011 its reverse (1103214032114), we get a palindrome (5215518155125).
The spelling of 4112304123011 in words is "four trillion, one hundred twelve billion, three hundred four million, one hundred twenty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •