Base | Representation |
---|---|
bin | 11001000010010100000010… |
… | …000011011000110100101101 |
3 | 112102212102102221211122201002 |
4 | 121002110002003120310231 |
5 | 103413021001404310333 |
6 | 1030103515304530045 |
7 | 32123123124616565 |
oct | 3102240203306455 |
9 | 472772387748632 |
10 | 110110111010093 |
11 | 320a2488111887 |
12 | 104240b1480925 |
13 | 49594537983bc |
14 | 1d29501b7dda5 |
15 | cae33b4370e8 |
hex | 6425020d8d2d |
110110111010093 has 4 divisors (see below), whose sum is σ = 110393170421820. Its totient is φ = 109827051598368.
The previous prime is 110110111010087. The next prime is 110110111010131. The reversal of 110110111010093 is 390010111011011.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 67458592569124 + 42651518440969 = 8213318^2 + 6530813^2 .
It is a cyclic number.
It is not a de Polignac number, because 110110111010093 - 214 = 110110110993709 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110110111010023) 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, 141529705280 + ... + 141529706057.
It is an arithmetic number, because the mean of its divisors is an integer number (27598292605455).
Almost surely, 2110110111010093 is an apocalyptic number.
It is an amenable number.
110110111010093 is a deficient number, since it is larger than the sum of its proper divisors (283059411727).
110110111010093 is an equidigital number, since it uses as much as digits as its factorization.
110110111010093 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 283059411726.
The product of its (nonzero) digits is 27, while the sum is 20.
The spelling of 110110111010093 in words is "one hundred ten trillion, one hundred ten billion, one hundred eleven million, ten thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •