Base | Representation |
---|---|
bin | 110011010001001111… |
… | …0001011000101000101 |
3 | 101112012001120120002021 |
4 | 1212202132023011011 |
5 | 3300441100013333 |
6 | 122325041043141 |
7 | 10645244365555 |
oct | 1464236130505 |
9 | 345161516067 |
10 | 110100001093 |
11 | 42769642445 |
12 | 194083264b1 |
13 | a4c8141054 |
14 | 54865b5165 |
15 | 2ce5c9c82d |
hex | 19a278b145 |
110100001093 has 2 divisors, whose sum is σ = 110100001094. Its totient is φ = 110100001092.
The previous prime is 110100001073. The next prime is 110100001163. The reversal of 110100001093 is 390100001011.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 70475913729 + 39624087364 = 265473^2 + 199058^2 .
It is a cyclic number.
It is not a de Polignac number, because 110100001093 - 213 = 110099992901 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110100001073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55050000546 + 55050000547.
It is an arithmetic number, because the mean of its divisors is an integer number (55050000547).
Almost surely, 2110100001093 is an apocalyptic number.
It is an amenable number.
110100001093 is a deficient number, since it is larger than the sum of its proper divisors (1).
110100001093 is an equidigital number, since it uses as much as digits as its factorization.
110100001093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27, while the sum is 16.
The spelling of 110100001093 in words is "one hundred ten billion, one hundred million, one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •