Base | Representation |
---|---|
bin | 11001000000101110011011… |
… | …001000000110011111101101 |
3 | 112102110222211112001121111022 |
4 | 121000232123020012133231 |
5 | 103404224032030310333 |
6 | 1025541433311503525 |
7 | 32112211400461436 |
oct | 3100563310063755 |
9 | 472428745047438 |
10 | 110001010010093 |
11 | 32060191480784 |
12 | 10406b23827ba5 |
13 | 494c087604977 |
14 | 1d2411213648d |
15 | cab5a321ec98 |
hex | 640b9b2067ed |
110001010010093 has 4 divisors (see below), whose sum is σ = 110001345838848. Its totient is φ = 110000674181340.
The previous prime is 110001010010081. The next prime is 110001010010161. The reversal of 110001010010093 is 390010010100011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 110001010010093 - 218 = 110001009747949 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 (110001010015093) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 167422571 + ... + 168078312.
It is an arithmetic number, because the mean of its divisors is an integer number (27500336459712).
Almost surely, 2110001010010093 is an apocalyptic number.
It is an amenable number.
110001010010093 is a deficient number, since it is larger than the sum of its proper divisors (335828755).
110001010010093 is an equidigital number, since it uses as much as digits as its factorization.
110001010010093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 335828754.
The product of its (nonzero) digits is 27, while the sum is 17.
The spelling of 110001010010093 in words is "one hundred ten trillion, one billion, ten million, ten thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •