Base | Representation |
---|---|
bin | 11001000000110110110011… |
… | …101000100101001001001011 |
3 | 112102111212001211012222001102 |
4 | 121000312303220211021023 |
5 | 103404401000321041021 |
6 | 1025545522412412015 |
7 | 32112650425542203 |
oct | 3100666350451113 |
9 | 472455054188042 |
10 | 110010011112011 |
11 | 32063a9035488a |
12 | 1040881617700b |
13 | 494cb9037c68a |
14 | 1d24727757403 |
15 | cab92d56800b |
hex | 640db3a2524b |
110010011112011 has 4 divisors (see below), whose sum is σ = 110010881151024. Its totient is φ = 110009141073000.
The previous prime is 110010011111951. The next prime is 110010011112031. The reversal of 110010011112011 is 110211110010011.
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 110010011112011 - 214 = 110010011095627 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110010011111983 and 110010011112001.
It is not an unprimeable number, because it can be changed into a prime (110010011112031) 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, 434829815 + ... + 435082736.
It is an arithmetic number, because the mean of its divisors is an integer number (27502720287756).
Almost surely, 2110010011112011 is an apocalyptic number.
110010011112011 is a deficient number, since it is larger than the sum of its proper divisors (870039013).
110010011112011 is an equidigital number, since it uses as much as digits as its factorization.
110010011112011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 870039012.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 110010011112011 its reverse (110211110010011), we get a palindrome (220221121122022).
The spelling of 110010011112011 in words is "one hundred ten trillion, ten billion, eleven million, one hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •