Base | Representation |
---|---|
bin | 110011001110100011… |
… | …0111000110110000011 |
3 | 101111221210020120220021 |
4 | 1212131012320312003 |
5 | 3300300030323021 |
6 | 122312104154311 |
7 | 10643102444035 |
oct | 1463506706603 |
9 | 344853216807 |
10 | 110010011011 |
11 | 4272286857a |
12 | 193a2168997 |
13 | a4b25c3794 |
14 | 547866bc55 |
15 | 2cdce23c41 |
hex | 199d1b8d83 |
110010011011 has 8 divisors (see below), whose sum is σ = 114853296384. Its totient is φ = 105171745800.
The previous prime is 110010011003. The next prime is 110010011071. The reversal of 110010011011 is 110110010011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110010011011 - 23 = 110010011003 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110010010985 and 110010011003.
It is not an unprimeable number, because it can be changed into a prime (110010011071) 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, 1210215 + ... + 1297936.
It is an arithmetic number, because the mean of its divisors is an integer number (14356662048).
Almost surely, 2110010011011 is an apocalyptic number.
110010011011 is a deficient number, since it is larger than the sum of its proper divisors (4843285373).
110010011011 is a wasteful number, since it uses less digits than its factorization.
110010011011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2510081.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 110010011011 its reverse (110110010011), we get a palindrome (220120021022).
It can be divided in two parts, 1100100 and 11011, that added together give a palindrome (1111111).
The spelling of 110010011011 in words is "one hundred ten billion, ten million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •