Base | Representation |
---|---|
bin | 11001000000110110110011… |
… | …000010011011100001001000 |
3 | 112102111212001010101212101202 |
4 | 121000312303002123201020 |
5 | 103404400440241023422 |
6 | 1025545521414203332 |
7 | 32112650244540104 |
oct | 3100666302334110 |
9 | 472455033355352 |
10 | 110010001111112 |
11 | 32063a85743a83 |
12 | 10408812953548 |
13 | 494cb8b28a59b |
14 | 1d247262b2904 |
15 | cab92c73eb92 |
hex | 640db309b848 |
110010001111112 has 32 divisors (see below), whose sum is σ = 206732740277880. Its totient is φ = 54881388503040.
The previous prime is 110010001111103. The next prime is 110010001111117. The reversal of 110010001111112 is 211111100010011.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 109227706854436 + 782294256676 = 10451206^2 + 884474^2 .
It is a junction number, because it is equal to n+sod(n) for n = 110010001111093 and 110010001111102.
It is not an unprimeable number, because it can be changed into a prime (110010001111117) 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 7 ways as a sum of consecutive naturals, for example, 68738 + ... + 14833230.
Almost surely, 2110010001111112 is an apocalyptic number.
It is an amenable number.
110010001111112 is a deficient number, since it is larger than the sum of its proper divisors (96722739166768).
110010001111112 is a wasteful number, since it uses less digits than its factorization.
110010001111112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14766593 (or 14766589 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 110010001111112 its reverse (211111100010011), we get a palindrome (321121101121123).
The spelling of 110010001111112 in words is "one hundred ten trillion, ten billion, one million, one hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •