Base | Representation |
---|---|
bin | 1011000000111001010011… |
… | …1010001110111110101101 |
3 | 1120212201001111101002000102 |
4 | 2300032110322032332231 |
5 | 3041402300320213401 |
6 | 41431132353440445 |
7 | 2356630235646464 |
oct | 260162472167655 |
9 | 46781044332012 |
10 | 12110011101101 |
11 | 3949910617381 |
12 | 1437002270125 |
13 | 69ac7a2a5594 |
14 | 2dc1b04519db |
15 | 160020eac56b |
hex | b0394e8efad |
12110011101101 has 4 divisors (see below), whose sum is σ = 12636533322912. Its totient is φ = 11583488879292.
The previous prime is 12110011101037. The next prime is 12110011101107. The reversal of 12110011101101 is 10110111001121.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 12110011101101 - 26 = 12110011101037 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12110011101107) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 263261110871 + ... + 263261110916.
It is an arithmetic number, because the mean of its divisors is an integer number (3159133330728).
Almost surely, 212110011101101 is an apocalyptic number.
It is an amenable number.
12110011101101 is a deficient number, since it is larger than the sum of its proper divisors (526522221811).
12110011101101 is an equidigital number, since it uses as much as digits as its factorization.
12110011101101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 526522221810.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 12110011101101 its reverse (10110111001121), we get a palindrome (22220122102222).
The spelling of 12110011101101 in words is "twelve trillion, one hundred ten billion, eleven million, one hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •