Base | Representation |
---|---|
bin | 110011001111110001… |
… | …1101010110001110001 |
3 | 101112001122120122010002 |
4 | 1212133203222301301 |
5 | 3300341041010001 |
6 | 122320133115345 |
7 | 10644112000130 |
oct | 1463743526161 |
9 | 345048518102 |
10 | 110051110001 |
11 | 42743a89888 |
12 | 193b3a88b55 |
13 | a4bac83601 |
14 | 547dcc9917 |
15 | 2ce184146b |
hex | 199f8eac71 |
110051110001 has 8 divisors (see below), whose sum is σ = 125857176960. Its totient is φ = 94266163008.
The previous prime is 110051109989. The next prime is 110051110073. The reversal of 110051110001 is 100011150011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 110051110001 - 26 = 110051109937 is a prime.
It is a super-2 number, since 2×1100511100012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110051110501) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5268821 + ... + 5289666.
It is an arithmetic number, because the mean of its divisors is an integer number (15732147120).
Almost surely, 2110051110001 is an apocalyptic number.
It is an amenable number.
110051110001 is a deficient number, since it is larger than the sum of its proper divisors (15806066959).
110051110001 is a wasteful number, since it uses less digits than its factorization.
110051110001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10559983.
The product of its (nonzero) digits is 5, while the sum is 11.
Adding to 110051110001 its reverse (100011150011), we get a palindrome (210062260012).
The spelling of 110051110001 in words is "one hundred ten billion, fifty-one million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •