Base | Representation |
---|---|
bin | 1011000000111001101100… |
… | …0000101011011110111011 |
3 | 1120212201022121222010210221 |
4 | 2300032123000223132323 |
5 | 3041403003021012021 |
6 | 41431150451320511 |
7 | 2356632620641456 |
oct | 260163300533673 |
9 | 46781277863727 |
10 | 12110113454011 |
11 | 3949963375661 |
12 | 14370305b0137 |
13 | 69ac95561031 |
14 | 2dc1bdc9649d |
15 | 160029e79241 |
hex | b039b02b7bb |
12110113454011 has 2 divisors, whose sum is σ = 12110113454012. Its totient is φ = 12110113454010.
The previous prime is 12110113453981. The next prime is 12110113454029. The reversal of 12110113454011 is 11045431101121.
It is a strong prime.
It is an emirp because it is prime and its reverse (11045431101121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12110113454011 - 211 = 12110113451963 is a prime.
It is a super-2 number, since 2×121101134540112 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (12110113454081) 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 as a sum of consecutive naturals, namely, 6055056727005 + 6055056727006.
It is an arithmetic number, because the mean of its divisors is an integer number (6055056727006).
Almost surely, 212110113454011 is an apocalyptic number.
12110113454011 is a deficient number, since it is larger than the sum of its proper divisors (1).
12110113454011 is an equidigital number, since it uses as much as digits as its factorization.
12110113454011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 480, while the sum is 25.
Adding to 12110113454011 its reverse (11045431101121), we get a palindrome (23155544555132).
The spelling of 12110113454011 in words is "twelve trillion, one hundred ten billion, one hundred thirteen million, four hundred fifty-four thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •