Base | Representation |
---|---|
bin | 10000001001110111001… |
… | …011010000001110000101 |
3 | 10221010100211212210022100 |
4 | 100021313023100032011 |
5 | 121141441324013333 |
6 | 2205550125022313 |
7 | 143126223551220 |
oct | 20116713201605 |
9 | 3833324783270 |
10 | 1110101001093 |
11 | 398878090687 |
12 | 15b18a6b4999 |
13 | 808b3699ab6 |
14 | 3ba2cbdc5b7 |
15 | 1dd22660213 |
hex | 102772d0385 |
1110101001093 has 48 divisors (see below), whose sum is σ = 1920900998016. Its totient is φ = 604479214080.
The previous prime is 1110101001073. The next prime is 1110101001127. The reversal of 1110101001093 is 3901001010111.
It is not a de Polignac number, because 1110101001093 - 26 = 1110101001029 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1110101001073) 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 in 47 ways as a sum of consecutive naturals, for example, 4886280 + ... + 5108417.
It is an arithmetic number, because the mean of its divisors is an integer number (40018770792).
Almost surely, 21110101001093 is an apocalyptic number.
It is an amenable number.
1110101001093 is a deficient number, since it is larger than the sum of its proper divisors (810799996923).
1110101001093 is a wasteful number, since it uses less digits than its factorization.
1110101001093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9994794 (or 9994791 counting only the distinct ones).
The product of its (nonzero) digits is 27, while the sum is 18.
The spelling of 1110101001093 in words is "one trillion, one hundred ten billion, one hundred one million, one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •