Base | Representation |
---|---|
bin | 11001000010001011101000… |
… | …111101100010000100010110 |
3 | 112102211120011222020111201101 |
4 | 121002023220331202010112 |
5 | 103412344023112010402 |
6 | 1030055425214020314 |
7 | 32122353620340253 |
oct | 3102135075420426 |
9 | 472746158214641 |
10 | 110101100110102 |
11 | 320996837562a2 |
12 | 104223b77a769a |
13 | 495864899ca0a |
14 | 1d28cc912c42a |
15 | cadeb0305b87 |
hex | 6422e8f62116 |
110101100110102 has 8 divisors (see below), whose sum is σ = 165151939459896. Its totient is φ = 55050453623472.
The previous prime is 110101100110093. The next prime is 110101100110109. The reversal of 110101100110102 is 201011001101011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110101100110109) 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, 46780048 + ... + 49077235.
It is an arithmetic number, because the mean of its divisors is an integer number (20643992432487).
Almost surely, 2110101100110102 is an apocalyptic number.
110101100110102 is a deficient number, since it is larger than the sum of its proper divisors (55050839349794).
110101100110102 is an equidigital number, since it uses as much as digits as its factorization.
110101100110102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 96431582.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 110101100110102 its reverse (201011001101011), we get a palindrome (311112101211113).
Subtracting 110101100110102 from its reverse (201011001101011), we obtain a palindrome (90909900990909).
The spelling of 110101100110102 in words is "one hundred ten trillion, one hundred one billion, one hundred million, one hundred ten thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •