Base | Representation |
---|---|
bin | 11001000000110110110010… |
… | …111110100111000110111011 |
3 | 112102111212001001112000010221 |
4 | 121000312302332213012323 |
5 | 103404400440012010021 |
6 | 1025545521340520511 |
7 | 32112650233200331 |
oct | 3100666276470673 |
9 | 472455031460127 |
10 | 110010000110011 |
11 | 32063a8511a921 |
12 | 10408812550137 |
13 | 494cb8acc9a11 |
14 | 1d247260d1b51 |
15 | cab92c5e3241 |
hex | 640db2fa71bb |
110010000110011 has 4 divisors (see below), whose sum is σ = 112350638410272. Its totient is φ = 107669361809752.
The previous prime is 110010000109993. The next prime is 110010000110047. The reversal of 110010000110011 is 110011000010011.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 110010000110011 - 229 = 110009463239099 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110010000109976 and 110010000110003.
It is not an unprimeable number, because it can be changed into a prime (110010000119011) 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, 1170319150060 + ... + 1170319150153.
It is an arithmetic number, because the mean of its divisors is an integer number (28087659602568).
Almost surely, 2110010000110011 is an apocalyptic number.
110010000110011 is a deficient number, since it is larger than the sum of its proper divisors (2340638300261).
110010000110011 is an equidigital number, since it uses as much as digits as its factorization.
110010000110011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2340638300260.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 110010000110011 its reverse (110011000010011), we get a palindrome (220021000120022).
The spelling of 110010000110011 in words is "one hundred ten trillion, ten billion, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •